2747 search results - page 75 / 550 » Non-oblivious Strategy Improvement |
138
click to vote
ICDCS
2008
IEEE
16 years 21 days ago
2008
IEEE
In this paper, we focus on securing communication over wireless data networks from malicious eavesdroppers, using smart antennas. While conventional cryptography based approaches ...
164
click to vote
DATE
2007
IEEE
16 years 18 days ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
194
click to vote
ATAL
2007
Springer
16 years 14 days ago
2007
Springer
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
130
click to vote
IROS
2006
IEEE
16 years 9 days ago
2006
IEEE
— A recent study showed that high failure rates in many instances of decoupled multi-robot motion planning makes the decoupled planning approach an unsuitable choice in compariso...
156
click to vote
ICALP
2007
Springer
16 years 13 days ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...