Sciweavers

ICTAI
1996
IEEE
16 years 23 hour ago
Binary CSP Solving as an Inference Process
We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understan...
Carlos Castro
208
Voted
ICTAI
1996
IEEE
16 years 23 hour ago
Automatic Diagnoses for Properly Stratified Knowledge-Bases
We present a mechanism for recovering consistent data from inconsistent set of assertions. For a common family of knowledge-bases we also provide an efficient algorithm for doing ...
Ofer Arieli, Arnon Avron
197
Voted
CP
1997
Springer
16 years 1 days ago
Programming Constraint Inference Engines
Abstract. Existing constraint programming systems offer a fixed set of inference engines implementing search strategies such as single, all, and best solution search. This is unfo...
Christian Schulte
168
Voted
CP
1997
Springer
16 years 1 days ago
GENIUS-CP: a Generic Single-Vehicle Routing Algorithm
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
CP
1997
Springer
16 years 1 days ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
CP
1997
Springer
16 years 1 days ago
Distributed Partial Constraint Satisfaction Problem
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
Katsutoshi Hirayama, Makoto Yokoo
175
Voted
CP
1997
Springer
16 years 1 days ago
Heavy-Tailed Distributions in Combinatorial Search
Abstract. Combinatorial search methods often exhibit a large variability in performance. We study the cost pro les of combinatorial search procedures. Our study reveals some intrig...
Carla P. Gomes, Bart Selman, Nuno Crato
CP
1997
Springer
16 years 1 days ago
Five Pitfalls of Empirical Scheduling Research
A number of pitfalls of empirical scheduling research are illustrated using real experimental data. These pitfalls, in general, serve to slow the progress of scheduling research b...
J. Christopher Beck, Andrew J. Davenport, Mark S. ...
173
Voted
CP
1997
Springer
16 years 1 days ago
Random Constraint Satisfaction: A More Accurate Picture
In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intrigu...
Dimitris Achlioptas, Lefteris M. Kirousis, Evangel...