|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3244584 |
| 003 |
MWH |
| 005 |
20191024051911.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s2000 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540453499
|
| 024 |
7 |
|
|a 10.1007/3-540-45349-0
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-3-540-45349-9
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a UMX
|2 bicssc
|
| 072 |
|
7 |
|a COM051010
|2 bisacsh
|
| 072 |
|
7 |
|a UMX
|2 thema
|
| 072 |
|
7 |
|a UMC
|2 thema
|
| 245 |
1 |
0 |
|a Principles and Practice of Constraint Programming - CP 2000
|h [electronic resource] :
|b 6th International Conference, CP 2000 Singapore, September 18-21, 2000 Proceedings /
|c edited by Rina Dechter.
|
| 250 |
|
|
|a 1st ed. 2000.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2000.
|
| 300 |
|
|
|a XII, 564 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 1894
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 505 |
0 |
|
|a Invited Papers -- Constraint-Based Agents: The ABC’s of CBA’s -- Constraints for Interactive Graphical Applications -- Meta-complexity Theorems: Talk Abstract -- Regular Papers -- Automatic Generation of Propagation Rules for Finite Domains -- Extending Forward Checking -- Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type -- Universally Quantified Interval Constraints -- Constraint Propagation for Soft Constraints: Generalization and Termination Conditions -- Constraints Inference Channels and Secure Databases -- Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints -- A Language for Audiovisual Template Specification and Recognition -- Random 3-SAT: The Plot Thickens -- New Tractable Classes from Old -- Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees -- Cutting Planes in Constraint Programming: An Hybrid Approach -- A Constraint-Based Framework for Prototyping Distributed Virtual Applications -- A Scalable Linear Constraint Solver for User Interface Construction -- A Constraint Programming Approach for Solving Rigid Geometric Systems -- Maintaining Arc-Consistency within Dynamic Backtracking -- New Search Heuristics for Max-CSP -- Analysis of Random Noise and Random Walk Algorithms for Satisfiability Testing -- Boosting Search with Variable Elimination -- Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint -- Practical Investigation of Constraints with Graph Views -- A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences -- Singleton Consistencies -- Linear Formulation of Constraint Programming Models and Hybrid Solvers -- A Global Constraint Combining a Sum Constraint and Difference Constraints -- Efficient Querying of Periodic Spatiotemporal Objects -- Arc Consistency for Soft Constraints -- Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization -- SAT v CSP -- Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies -- Arc Consistency on n-ary Monotonic and Linear Constraints -- Poster Papers -- Some Observations on Durations, Scheduling and Allen’s Algebra -- Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability -- Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances -- Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes -- Constraint Propagation: Between Abstract Models and ad hoc Strategies -- How to Model and Verify Concurrent Algorithms for Distributed CSPs -- The Phase Transition in Distributed Constraint Satisfaction Problems: First Results -- Cooperating Constraint Solvers -- An Empirical Study of Probabilistic Arc Consistency as a Variable Ordering Heuristic -- On Dual Encodings for Non-binary Constraint Satisfaction Problems -- Algebraic Simplification Techniques for Propositional Satisfiability -- An Original Constraint Based Approach for Solving over Constrained Problems -- An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions.
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 700 |
1 |
|
|a Dechter, Rina.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 1894
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/3-540-45349-0
|3 Click to view e-book
|t 0
|
| 907 |
|
|
|a .b32445842
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g gw
|h 0
|i 1
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i21577493
|z 02-26-20
|
| 999 |
f |
f |
|i 1dbfba0a-6f96-5ef2-bc71-c04be5502229
|s 10cb4ff7-fafa-55a0-a5d6-816f7bdff7d9
|t 0
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|