4447 search results - page 779 / 890 » Model Checking Games |
184
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
201
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We examine a model in which multiple buyers with single-unit demand are faced with an infinite sequence of auctions. New buyers arrive on the market probabilistically, and are each...
177
click to vote
TCS
2008
15 years 6 months ago
2008
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
163
click to vote
TCS
2008
15 years 6 months ago
2008
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
163
click to vote
JNW
2007
15 years 6 months ago
2007
— Wireless sensor networks offer the potential to significantly improve the performance of pursuers in pursuit-evasion games. In this paper, we study several sensor network syst...