1599 search results - page 174 / 320 » Algorithms for Parity Games |
210
click to vote
JSAC
2008
15 years 6 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
154
click to vote
FSTTCS
2007
Springer
16 years 23 days ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
170
click to vote
FLAIRS
2010
15 years 6 months ago
2010
We present a novel algorithm that allows agents to discover a navigation mesh for an environment as they move through the environment. The Navigation-Mesh Automated Discovery (NMA...
162
click to vote
JSAC
2006
15 years 6 months ago
2006
We consider a distributed power control scheme for wireless ad hoc networks, in which each user announces a price that reflects compensation paid by other users for their interfere...
182
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...