Sciweavers

2109 search results - page 113 / 422
» Solving Necklace Constraint Problems
Sort
View
159
Voted
EUROCAST
1994
Springer
139views Hardware» more  EUROCAST 1994»
15 years 9 months ago
Illustrating Constraint Programming Systems in Logistic Planning
Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint Logic programs, emphasizin...
Jean-Michel Thizy
142
Voted
TVCG
2011
120views more  TVCG 2011»
14 years 12 months ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff
MICCAI
2009
Springer
16 years 6 months ago
Setting Priors and Enforcing Constraints on Matches for Nonlinear Registration of Meshes
Abstract. We show that a simple probabilistic modelling of the registration problem for surfaces allows to solve it by using standard clustering techniques. In this framework, poin...
Benoît Combès, Sylvain Prima
154
Voted
ICRA
2005
IEEE
182views Robotics» more  ICRA 2005»
15 years 10 months ago
Control Synthesis for Dynamic Contact Manipulation
— We explore the control synthesis problem for a robot dynamically manipulating an object in the presence of multiple frictional contacts. Contacts occur both between the object ...
Siddhartha S. Srinivasa, Michael Erdmann, Matthew ...
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
15 years 5 months ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker