Sciweavers

360 search results - page 44 / 72
» The TV-Break Packing Problem
Sort
View
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
15 years 4 months ago
Grasping POMDPs
Abstract— We provide a method for planning under uncertainty for robotic manipulation by partitioning the configuration space into a set of regions that are closed under complia...
Kaijen Hsiao, Leslie Pack Kaelbling, Tomás ...
AAAI
1998
14 years 11 months ago
A Framework for Reinforcement Learning on Real Robots
Learning on real robots in an real, unaltered environment provides an extremely challenging problem. Many of the simplifying assumptions made in other areas of learning cannot be ...
William D. Smart, Leslie Pack Kaelbling
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
15 years 2 months ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
Kasturi Varadarajan
DISOPT
2008
78views more  DISOPT 2008»
14 years 9 months ago
N-fold integer programming
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
Jesús A. De Loera, Raymond Hemmecke, Shmuel...
77
Voted
ATMOS
2010
163views Optimization» more  ATMOS 2010»
14 years 8 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...