Sciweavers

793 search results - page 113 / 159
» Analogical Path Planning
Sort
View
ATAL
2011
Springer
12 years 8 months ago
A study of computational and human strategies in revelation games
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...
Noam Peled, Ya'akov (Kobi) Gal, Sarit Kraus
CIMCA
2008
IEEE
14 years 2 months ago
Tree Exploration for Bayesian RL Exploration
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, ...
Christos Dimitrakakis
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
13 years 8 months ago
On the Convergence of Multicast Games in Directed Networks
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 ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
ICFP
2007
ACM
14 years 8 months ago
Relating complexity and precision in control flow analysis
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 ...
David Van Horn, Harry G. Mairson
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 8 months ago
The Power of Nondeterminism in Self-Assembly
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...
Nathaniel Bryans, Ehsan Chiniforooshan, David Doty...