Though more diicult to program, distributed-memory parallel machines provide greater scalability than their shared-memory counterparts. Distributed Shared Memory (DSM) systems provide the abstraction of shared memory on a distributed machine. While DSMs provide an attractive programming model, they currently can not eeciently support all classes of scientiic applications. One such class are tho...

Introduction Conclusions References

Though more difficult to program, distributed-memory parallel machines provide greater scalability than their shared-memory counterparts. Distributed Shared Memory (DSM) systems provide the abstraction of shared memory on a distributed machine. While DSMs provide an attractive programming model, they currently can not efficiently support all classes of scientific applications. One such class ar...

The Clark completion of a program is a way of making explicit the inferences which may be made from the program using the Negation as Failure (NAF) rule. This may be thought of as adding negative information to the program in such a way that an atom fails ii its negation is derivable from the completion of the program. We show how the completion process may be extended to hereditary Harrop form...

Although explicit and implicit knowledge of language learners are essential to theoretical and pedagogical debates in second language acquisition (SLA), little research has addressed the effects of instructional interventions on the two knowledge types (R. Ellis, 2005).This study examined the relative effectiveness of explicit and implicit types of form-focused instruction (FFI) on the acquisit...

Participants watched a violent, sexually explicit, or neutral TV program that contained 9 ads. Participants recalled the advertised brands. They also identified the advertised brands from slides of supermarket shelves. The next day, participants were telephoned and asked to recall again the advertised brands. Results showed better memory for people who saw the ads during a neutral program than ...

Poker is an interesting test-bed for artificial intelligence research. It is a game of imperfect knowledge, where multiple competing agents must deal with risk management, opponent modeling, unreliable information, and deception, much like decision-making applications in the real world. Opponent modeling is one of the most difficult problems in decision-making applications and in poker it is es...