11345 search results - page 2129 / 2269 » Foundations of Computer Science |
114
click to vote
ATAL
2010
Springer
15 years 21 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
114
click to vote
ATAL
2010
Springer
15 years 21 days ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
94
Voted
AI
2008
Springer
14 years 11 months ago
2008
Springer
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
COMPUTING
2008
14 years 11 months ago
2008
We introduce two data-structural transformations to construct doubleended priority queues from priority queues. To apply our transformations the priority queues exploited must sup...
DC
2008
14 years 11 months ago
2008
We study the feasibility and cost of implementing --a fundamental failure detector at the core of many algorithms--in systems with weak reliability and synchrony assumptions. Intui...