| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465876203316 |
|
|
Titolo |
Recent Advances in Constraints [[electronic resource] ] : Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, Uppsala, Sweden, June 20-22, 2005, Revised Selected and Invited Papers / / edited by Brahim Hnich, Mats Carlsson, Francois Fages, Francesca Rossi |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2006.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VIII, 179 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Artificial Intelligence ; ; 3978 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer industry |
Artificial intelligence |
Software engineering |
Programming languages (Electronic computers) |
Computer logic |
Algorithms |
The Computer Industry |
Artificial Intelligence |
Software Engineering/Programming and Operating Systems |
Programming Languages, Compilers, Interpreters |
Logics and Meanings of Programs |
Algorithm Analysis and Problem Complexity |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Global Constraints -- The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables -- Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains -- Among, Common and Disjoint Constraints -- Search and Heuristics -- Partitioning Based Algorithms for Some Colouring Problems -- A CSP Search Algorithm with Reduced Branching Factor -- Analysis of Heuristic Synergies -- Complexity Analysis of Heuristic CSP |
|
|
|
|
|
|
|
|
|
|
Search Algorithms -- Language and Implementation Issues -- A Type System for CHR -- Views and Iterators for Generic Constraint Implementations -- Modeling -- A Hybrid Benders’ Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse -- The Challenge of Exploiting Weak Symmetries -- On Generators of Random Quasigroup Problems. |
|
|
|
|
|
| |