عنوان
پدید آورنده
موضوع
رده
کتابخانه
محل استقرار
3540637532
9783540637530
b552315
Principles and practice of constraint programming--CP'97 :
[Book]
Third International Conference, CP'97, Linz, Austria, October 29-November 1, 1997 : proceedings
Gert Smolka (ed.).
Berlin ; New York
Springer
©1997.
xii, 561 pages : illustrations ; 24 cm
Lecture notes in computer science, 1330.
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.
Constraint programming (Computer science)
Constraint programming (Computer science) -- Congresses.
Programmatuurtechniek.
Gert Smolka (ed.).
Gert Smolka
مطالعه متن کتاب [Book]
Y
