879 search results - page 5 / 176 » A Constraint Programming Approach for the Service Consolidat... |
IJCAI
1989
13 years 9 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
CP
2005
Springer
14 years 1 months ago
2005
Springer
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...
ECOWS
2009
Springer
14 years 2 months ago
2009
Springer
—Current Web service composition approaches and languages such as WS-BPEL do not allow to define temporal constraints in a declarative and separate way. Also it is not possible ...
CPAIOR
2006
Springer
14 years 1 days ago
2006
Springer
Tail Assignment is the problem of assigning flight legs to aircraft while satisfying all operational constraints, and optimizing some objective function. In this article, we presen...
CP
2009
Springer
14 years 9 months ago
2009
Springer
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...