Sciweavers

7092 search results - page 268 / 1419
» Parallelizing constraint programs
Sort
View
FLAIRS
2004
15 years 3 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
125
Voted
ESCIENCE
2005
IEEE
15 years 8 months ago
Distributed, Parallel Web Service Orchestration Using XSLT
GridXSLT is an implementation of the XSLT programming language designed for distributed web service orchestration. Based on the functional semantics of the language, it compiles p...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...
AAAI
2008
15 years 4 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
AAMAS
2002
Springer
15 years 2 months ago
A Scheduling Scheme for Controlling Allocation of CPU Resources for Mobile Programs
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support eff...
Manoj Lal, Raju Pandey
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 26 days ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet