Sciweavers

417 search results - page 36 / 84
» In Search of the Best Constraint Satisfaction Search
Sort
View
CPAIOR
2009
Springer
15 years 4 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
ECAI
2004
Springer
15 years 3 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
JAIR
2010
145views more  JAIR 2010»
14 years 8 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
IWPC
2000
IEEE
15 years 2 months ago
A Pattern Matching Framework for Software Architecture Recovery and Restructuring
This paper presents a framework for software architecture recovery and restructuring. The user specifies a high level abstraction view of the system using a structured pattern la...
Kamran Sartipi, Kostas Kontogiannis, Farhad Mavadd...
EVOW
2009
Springer
15 years 4 months ago
A Tabu Search Algorithm with Direct Representation for Strip Packing
Abstract. This paper introduces a new tabu search algorithm for a twodimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of...
Jean-Philippe Hamiez, Julien Robet, Jin-Kao Hao