251 search results - page 34 / 51 » Agents Talking Faster |
ATAL
2008
Springer
13 years 12 months ago
2008
Springer
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
MATES
2010
Springer
13 years 8 months ago
2010
Springer
Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents...
AMEC
2003
Springer
14 years 3 months ago
2003
Springer
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
IJCAI
2007
13 years 11 months ago
2007
We present a reinforcement learning game player that can interact with a General Game Playing system and transfer knowledge learned in one game to expedite learning in many other ...
USENIX
1993
13 years 11 months ago
1993
Manyversions of Unix provide facilities for user-levelpacket capture, making possible the use of general purpose workstations for network monitoring. Because network monitors run ...