Sciweavers

1813 search results - page 121 / 363
» Calculi of Approximation Spaces
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
16 years 6 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
ICRA
2009
IEEE
101views Robotics» more  ICRA 2009»
16 years 1 months ago
Global vector field computation for feedback motion planning
— We present a global vector field computation algorithm in configuration spaces for smooth feedback motion planning. Our algorithm performs approximate cell decomposition in t...
Liangjun Zhang, Steven M. LaValle, Dinesh Manocha
GECCO
2005
Springer
144views Optimization» more  GECCO 2005»
15 years 12 months ago
Multiobjective hBOA, clustering, and scalability
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
Martin Pelikan, Kumara Sastry, David E. Goldberg
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
15 years 11 months ago
Q-learning and Pontryagin's Minimum Principle
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...
Prashant G. Mehta, Sean P. Meyn