793 search results - page 113 / 159 » Analogical Path Planning |
113
Voted
ATAL
2011
Springer
14 years 16 days ago
2011
Springer
Revelation games are bilateral bargaining games in which agents may choose to truthfully reveal their private information before engaging in multiple rounds of negotiation. They a...
124
Voted
CIMCA
2008
IEEE
15 years 7 months ago
2008
IEEE
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
110
Voted
ALGORITHMICA
2010
15 years 20 days ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
118
click to vote
ICFP
2007
ACM
16 years 15 days ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
116
Voted
CORR
2010
Springer
15 years 19 days ago
2010
Springer
tigate the role of nondeterminism in Winfree's abstract Tile Assembly Model (aTAM), which was conceived to model artificial molecular self-assembling systems constructed from...