Sciweavers

2861 search results - page 126 / 573
» Constraint Programming
Sort
View
CP
2005
Springer
15 years 3 months ago
From Linear Relaxations to Global Constraint Propagation
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
Claude-Guy Quimper, Alejandro López-Ortiz
PODS
2006
ACM
138views Database» more  PODS 2006»
15 years 10 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
JCO
2011
63views more  JCO 2011»
14 years 25 days ago
Robust multi-sensor scheduling for multi-site surveillance
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
Nikita Boyko, Timofey Turko, Vladimir Boginski, Da...
CP
2005
Springer
15 years 3 months ago
Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
Chris Houghton, David A. Cohen
CP
2005
Springer
15 years 3 months ago
Encoding Requests to Web Service Compositions as Constraints
Interacting with a web service enabled marketplace in order to achieve a complex task involves sequencing a set of individual service operations, gathering information from the ser...
Alexander Lazovik, Marco Aiello, Rosella Gennari