Sciweavers

94 search results - page 11 / 19
» Non-clairvoyant Scheduling Games
Sort
View
AAAI
2008
15 years 2 months ago
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications
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 adversary/follower) before the advers...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
ATAL
2008
Springer
15 years 1 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...
EUROPAR
2008
Springer
15 years 1 months ago
Guest-Aware Priority-Based Virtual Machine Scheduling for Highly Consolidated Server
The use of virtualization is rapidly expanding from server consolidation to various computing systems including PC, multimedia set-top box and gaming console. However, different fr...
Dongsung Kim, Hwanju Kim, Myeongjae Jeon, Euiseong...
CHI
2008
ACM
16 years 3 days ago
Temporal trajectories in shared interactive narratives
Temporal trajectories can represent the complex mappings between story time and clock time that are to be found in shared interactive narratives such as computer games and interac...
Steve Benford, Gabriella Giannachi