Sciweavers

5169 search results - page 8 / 1034
» Locality approximation using time
Sort
View
IPCO
2010
210views Optimization» more  IPCO 2010»
13 years 5 months ago
A 3-Approximation for Facility Location with Uniform Capacities
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen G...
NIPS
2007
13 years 8 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens
TROB
2011
255views more  TROB 2011»
13 years 1 months ago
Active 3D Object Localization Using a Humanoid Robot
—We study the problem of actively searching for an object in a 3D environment under the constraint of a maximum search time, using a visually guided humanoid robot with twentysix...
Alexander Andreopoulos, Stephan Hasler, Heiko Wers...
DATE
2006
IEEE
114views Hardware» more  DATE 2006»
14 years 23 days ago
A built-in redundancy-analysis scheme for RAMs with 2D redundancy using 1D local bitmap
Built-in self-repair (BISR) technique is gaining popular for repairing embedded memory cores in system-onchips (SOCs). To increase the utilization of memory redundancy, the BISR t...
Tsu-Wei Tseng, Jin-Fu Li, Da-Ming Chang
IPSN
2009
Springer
14 years 1 months ago
Near-optimal Bayesian localization via incoherence and sparsity
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
Volkan Cevher, Petros Boufounos, Richard G. Barani...