Principles and Practice of Constraint Programming - CP 2000 6th International Conference, CP 2000 Singapore, September 18-21, 2000 Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Dechter, Rina (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
Έκδοση:1st ed. 2000.
Σειρά:Lecture Notes in Computer Science, 1894
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05679nam a2200577 4500
001 978-3-540-45349-9
003 DE-He213
005 20191024051911.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 |a 9783540453499  |9 978-3-540-45349-9 
024 7 |a 10.1007/3-540-45349-0  |2 doi 
040 |d GrThAP 
050 4 |a QA76.7-76.73 
050 4 |a QA76.76.C65 
072 7 |a UMX  |2 bicssc 
072 7 |a COM051010  |2 bisacsh 
072 7 |a UMX  |2 thema 
072 7 |a UMC  |2 thema 
082 0 4 |a 005.13  |2 23 
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 
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. 
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. 
650 1 4 |a Programming Languages, Compilers, Interpreters.  |0 http://scigraph.springernature.com/things/product-market-codes/I14037 
650 2 4 |a Artificial Intelligence.  |0 http://scigraph.springernature.com/things/product-market-codes/I21000 
650 2 4 |a Programming Techniques.  |0 http://scigraph.springernature.com/things/product-market-codes/I14010 
650 2 4 |a Logics and Meanings of Programs.  |0 http://scigraph.springernature.com/things/product-market-codes/I1603X 
650 2 4 |a Mathematical Logic and Formal Languages.  |0 http://scigraph.springernature.com/things/product-market-codes/I16048 
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 
776 0 8 |i Printed edition:  |z 9783662174272 
776 0 8 |i Printed edition:  |z 9783540410539 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 1894 
856 4 0 |u https://doi.org/10.1007/3-540-45349-0  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)