Sciweavers

6315 search results - page 221 / 1263
» Approximating Solution Structure
Sort
View
ATAL
2007
Springer
16 years 23 days ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa
ISER
2004
Springer
158views Robotics» more  ISER 2004»
15 years 12 months ago
Collective Inspection of Regular Structures using a Swarm of Miniature Robots
We present a series of experiments concerned with the inspection of regular, engineered structures carried out using swarms of five to twenty autonomous, miniature robots, solely ...
Nikolaus Correll, Alcherio Martinoli
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
VLDB
1998
ACM
111views Database» more  VLDB 1998»
15 years 10 months ago
Filtering with Approximate Predicates
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
Narayanan Shivakumar, Hector Garcia-Molina, Chandr...
ADCM
2008
136views more  ADCM 2008»
15 years 6 months ago
Learning and approximation by Gaussians on Riemannian manifolds
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
Gui-Bo Ye, Ding-Xuan Zhou