Sciweavers

13841 search results - page 234 / 2769
» Algorithms and Constraint Programming
Sort
View
4OR
2006
100views more  4OR 2006»
15 years 6 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...
ICRA
2010
IEEE
123views Robotics» more  ICRA 2010»
15 years 5 months ago
Robotic motion planning in dynamic, cluttered, uncertain environments
— This paper presents a strategy for planning robot motions in dynamic, cluttered, and uncertain environments. Successful and efficient operation in such environments requires r...
Noel E. Du Toit, Joel W. Burdick
APLAS
2000
ACM
15 years 11 months ago
An Open Environment for Cooperative Equational Solving
We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed co...
Tetsuo Ida, Mircea Marin
ITA
2007
153views Communications» more  ITA 2007»
15 years 6 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
CPAIOR
2005
Springer
16 years 4 days ago
Combination of Among and Cardinality Constraints
A cardinality constraint imposes that each value of a set V must be taken a certain number of times by a set of variables X, whereas an among constraint imposes that a certain numb...
Jean-Charles Régin