Sciweavers

242 search results - page 4 / 49
» Provably Bounded Optimal Agents
Sort
View
ATAL
2008
Springer
13 years 9 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
AAAI
1994
13 years 9 months ago
Applying VC-Dimension Analysis To 3D Object Recognition from Perspective Projections
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
Michael Lindenbaum, Shai Ben-David
ALENEX
2007
130views Algorithms» more  ALENEX 2007»
13 years 9 months ago
Locating Guards for Visibility Coverage of Polygons
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
Yoav Amit, Joseph S. B. Mitchell, Eli Packer
ICML
2010
IEEE
13 years 9 months ago
Internal Rewards Mitigate Agent Boundedness
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
Jonathan Sorg, Satinder P. Singh, Richard Lewis
ATAL
2010
Springer
13 years 9 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...