1542 search results - page 85 / 309 » Kernelization of packing problems |
NIPS
2003
15 years 1 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
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...
AAAI
1998
15 years 1 months ago
1998
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 ...
105
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
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 ...
DISOPT
2008
14 years 12 months ago
2008
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 ...