|
" Principles and practice of constraint programming--CP'97 : "
Gert Smolka (ed.).
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
732527
|
| Doc. No
|
:
|
b552315
|
| Main Entry
|
:
|
Gert Smolka (ed.).
|
| Title & Author
|
:
|
Principles and practice of constraint programming--CP'97 : : Third International Conference, CP'97, Linz, Austria, October 29-November 1, 1997 : proceedings\ Gert Smolka (ed.).
|
| Publication Statement
|
:
|
Berlin ; New York: Springer, ©1997.
|
| Series Statement
|
:
|
Lecture notes in computer science, 1330.
|
| Page. NO
|
:
|
xii, 561 pages : illustrations ; 24 cm
|
| ISBN
|
:
|
3540637532
|
|
|
:
|
: 9783540637530
|
| Contents
|
:
|
Visual Solver A modeling language for constraint programming.- Narrowing a 2n-block of sortings in O (n logn).- Solving various weighted matching problems with constraints.- A filtering algorithm for global sequencing constraints.- Semantics and expressive power of a timed concurrent constraint language.- Solving classes of set constraints with tree automata.- The logic of search algorithms: Theory and applications.- Verification of parallel systems using constraint programming.- Random constraint satisfaction: A more accurate picture.- Heavy-tailed distributions in combinatorial search.- Counting, structure identification and maximum consistency for binary constraint satisfaction problems.- Statistical analysis of backtracking on inconsistent CSPs.- Using constraint propagation for complex scheduling problems: Managing size, complex resources and travel.- Understanding and improving the MAC algorithm.- Modelling exceptionally hard constraint satisfaction problems.- Tabu search for maximal constraint satisfaction problems.- Reconfigurable architectures: A new vision for optimization problems.- Distributed partial constraint satisfaction problem.- Localizer A modeling language for local search.- Operational semantics and confluence of constraint propagation rules.- AC-unification of higher-order patterns.- On the complexity of unification and disunification in commutative idempotent semigroups.- Ordering constraints over feature trees.- From restricted path consistency to max-restricted path consistency.- The constrainedness of Arc consistency.- Look-ahead versus look-back for satisfiability problems.- Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs.- Interval methods for non-linear constraints.- Configurable solvers: Tailoring general methods to specific applications.- Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems.- Five pitfalls of empirical scheduling research.- Bounding the optimum of constraint optimization problems.- GENIUS-CP: A generic single-vehicle routing algorithm.- Satisfiability of quantitative temporal constraints with multiple granularities.- Tractable recursion over geometric data.- Finding solvable subsets of constraint graphs.- Tractable disjunctive constraints.- Compiling constraint solving using projection.- Oscillation, heuristic ordering and pruning in neighborhood search.- Programming constraint inference engines.- NeMo+: Object-oriented constraint programming environment based on subdefinite models.- Set constraints: A pearl in research on constraints.
|
| Subject
|
:
|
Constraint programming (Computer science)
|
| Subject
|
:
|
Constraint programming (Computer science) -- Congresses.
|
| Subject
|
:
|
Programmatuurtechniek.
|
| Added Entry
|
:
|
Gert Smolka
|
| |