Sciweavers

658 search results - page 107 / 132
» Partially Ordered Constraint Optimization Problems
Sort
View
GIS
2011
ACM
14 years 1 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
15 years 1 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
IOR
2007
106views more  IOR 2007»
14 years 9 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
ICRA
2009
IEEE
145views Robotics» more  ICRA 2009»
15 years 4 months ago
A two-steps next-best-view algorithm for autonomous 3D object modeling by a humanoid robot
— A novel approach is presented which aims at building autonomously visual models of unknown objects, using a humanoid robot. Although good methods have been proposed for the spe...
Torea Foissotte, Olivier Stasse, Adrien Escande, P...
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 9 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...