|
|
|
|
| LEADER |
03262nam a22006135i 4500 |
| 001 |
978-3-540-32252-8 |
| 003 |
DE-He213 |
| 005 |
20151123144020.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100707s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540322528
|9 978-3-540-32252-8
|
| 024 |
7 |
|
|a 10.1007/b106890
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a Q334-342
|
| 050 |
|
4 |
|a TJ210.2-211.495
|
| 072 |
|
7 |
|a UYQ
|2 bicssc
|
| 072 |
|
7 |
|a TJFM1
|2 bicssc
|
| 072 |
|
7 |
|a COM004000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 006.3
|2 23
|
| 245 |
1 |
0 |
|a Recent Advances in Constraints
|h [electronic resource] :
|b Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, Lausanne, Switzerland, June 23-25, 2004, Revised Selected and Invited Papers /
|c edited by Boi V. Faltings, Adrian Petcu, François Fages, Francesca Rossi.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
| 300 |
|
|
|a X, 217 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3419
|
| 505 |
0 |
|
|a Constraint 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 |
|a Computer science.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Numeric Computing.
|
| 700 |
1 |
|
|a Faltings, Boi V.
|e editor.
|
| 700 |
1 |
|
|a Petcu, Adrian.
|e editor.
|
| 700 |
1 |
|
|a Fages, François.
|e editor.
|
| 700 |
1 |
|
|a Rossi, Francesca.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540251767
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3419
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b106890
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
