Sciweavers

721 search results - page 72 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
CP
2005
Springer
15 years 3 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
ECAI
2004
Springer
15 years 3 months ago
Tractable Symmetry Breaking Using Restricted Search Trees
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, St...
ECAI
2010
Springer
14 years 11 months ago
Restarts and Nogood Recording in Qualitative Constraint-based Reasoning
Abstract. This paper introduces restart and nogood recording techniques in the domain of qualitative spatial and temporal reasoning. Nogoods and restarts can be applied orthogonall...
Matthias Westphal, Stefan Wölfl, Jason Jingsh...
ATAL
2003
Springer
15 years 3 months ago
A multiagent-system for integrating a large-scale project
This paper presents a multiagent-system for integrating ALICE: a real-life, distributed, large-scale particle physics experiment of the LHC project at CERN. The work is concerned ...
Carlos Eisenberg, Boi Faltings, Lars Leistam
EXPCS
2007
15 years 1 months ago
Performance testing of combinatorial solvers with isomorph class instances
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
Franc Brglez, Jason A. Osborne