| 000 | 05363nam a22005895i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-45349-9 | ||
| 003 | DE-He213 | ||
| 005 | 20240423132500.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2000 gw | s |||| 0|eng d | ||
| 020 |
_a9783540453499 _9978-3-540-45349-9 |
||
| 024 | 7 |
_a10.1007/3-540-45349-0 _2doi |
|
| 050 | 4 | _aQA76.76.C65 | |
| 072 | 7 |
_aUMC _2bicssc |
|
| 072 | 7 |
_aCOM010000 _2bisacsh |
|
| 072 | 7 |
_aUMC _2thema |
|
| 082 | 0 | 4 |
_a005.45 _223 |
| 245 | 1 | 0 |
_aPrinciples and Practice of Constraint Programming - CP 2000 _h[electronic resource] : _b6th International Conference, CP 2000 Singapore, September 18-21, 2000 Proceedings / _cedited by Rina Dechter. |
| 250 | _a1st ed. 2000. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2000. |
|
| 300 |
_aXII, 564 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 Computer Science, _x1611-3349 ; _v1894 |
|
| 505 | 0 | _aInvited 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 andDifference 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 | _aCompilers (Computer programs). | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 0 | _aComputer programming. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aMachine theory. | |
| 650 | 1 | 4 | _aCompilers and Interpreters. |
| 650 | 2 | 4 | _aArtificial Intelligence. |
| 650 | 2 | 4 | _aProgramming Techniques. |
| 650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
| 650 | 2 | 4 | _aFormal Languages and Automata Theory. |
| 700 | 1 |
_aDechter, Rina. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540410539 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662174272 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1894 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-45349-0 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c188232 _d188232 |
||