000 | 03526nam a22006495i 4500 | ||
---|---|---|---|
001 | 978-3-540-32252-8 | ||
003 | DE-He213 | ||
005 | 20240423125806.0 | ||
007 | cr nn 008mamaa | ||
008 | 100707s2005 gw | s |||| 0|eng d | ||
020 |
_a9783540322528 _9978-3-540-32252-8 |
||
024 | 7 |
_a10.1007/b106890 _2doi |
|
050 | 4 | _aQ334-342 | |
050 | 4 | _aTA347.A78 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
072 | 7 |
_aUYQ _2thema |
|
082 | 0 | 4 |
_a006.3 _223 |
245 | 1 | 0 |
_aRecent Advances in Constraints _h[electronic resource] : _bJoint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, Lausanne, Switzerland, June 23-25, 2004, Revised Selected and Invited Papers / _cedited by Boi Faltings, Adrian Petcu, François Fages, Francesca Rossi. |
250 | _a1st ed. 2005. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005. |
|
300 |
_aX, 217 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v3419 |
|
505 | 0 | _aConstraint Propagation -- GCC-Like Restrictions on the Same Constraint -- A Note on Bilattices and Open Constraint Programming -- Pruning by Equally Constrained Variables -- Search -- Trying Again to Fail-First -- Characterization of a New Restart Strategy for Randomized Backtrack Search -- Dynamic Distributed BackJumping -- A Value Ordering Heuristic for Local Search in Distributed Resource Allocation -- Automatically Exploiting Symmetries in Constraint Programming -- New Structural Decomposition Techniques for Constraint Satisfaction Problems -- Applications -- Algorithms for the Maximum Hamming Distance Problem -- A System Prototype for Solving Multi-granularity Temporal CSP -- Computing Equilibria Using Interval Constraints -- Constraint-Based Approaches to the Covering Test Problem -- Super Solutions for Combinatorial Auctions -- Better Propagation for Non-preemptive Single-Resource Constraint Problems. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aNumerical analysis. | |
650 | 1 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aCompilers and Interpreters. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aNumerical Analysis. |
700 | 1 |
_aFaltings, Boi. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aPetcu, Adrian. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aFages, François. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRossi, Francesca. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540251767 |
776 | 0 | 8 |
_iPrinted edition: _z9783540808558 |
830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v3419 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b106890 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c181757 _d181757 |