Sciweavers

18466 search results - page 3508 / 3694
» On distributed systems and CSCL
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
ATAL
2008
Springer
15 years 8 months ago
Using multi-agent potential fields in real-time strategy games
Bots for Real Time Strategy (RTS) games provide a rich challenge to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while...
Johan Hagelbäck, Stefan J. Johansson
ATAL
2008
Springer
15 years 8 months ago
A statistical relational model for trust learning
We address the learning of trust based on past observations and context information. We argue that from the truster's point of view trust is best expressed as one of several ...
Achim Rettinger, Matthias Nickles, Volker Tresp
CASES
2008
ACM
15 years 8 months ago
Efficient vectorization of SIMD programs with non-aligned and irregular data access hardware
Automatic vectorization of programs for partitioned-ALU SIMD (Single Instruction Multiple Data) processors has been difficult because of not only data dependency issues but also n...
Hoseok Chang, Wonyong Sung
ISCA
2010
IEEE
214views Hardware» more  ISCA 2010»
15 years 8 months ago
Translation caching: skip, don't walk (the page table)
This paper explores the design space of MMU caches that accelerate virtual-to-physical address translation in processor architectures, such as x86-64, that use a radix tree page t...
Thomas W. Barr, Alan L. Cox, Scott Rixner
« Prev « First page 3508 / 3694 Last » Next »