Recent Advances in Constraints 11th Annual ERCIM International Workshop on Constraint Solving and Contraint Logic Programming, CSCLP 2006, Caparica, Portugal, June 26-28, 2006, Revised Selected and Invited Papers /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Azevedo, Francisco (Επιμελητής έκδοσης), Barahona, Pedro (Επιμελητής έκδοσης), Fages, François (Επιμελητής έκδοσης), Rossi, Francesca (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
Σειρά:Lecture Notes in Computer Science, 4651
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03116nam a22006135i 4500
001 978-3-540-73817-6
003 DE-He213
005 20151123151047.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540738176  |9 978-3-540-73817-6 
024 7 |a 10.1007/978-3-540-73817-6  |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 11th Annual ERCIM International Workshop on Constraint Solving and Contraint Logic Programming, CSCLP 2006, Caparica, Portugal, June 26-28, 2006, Revised Selected and Invited Papers /  |c edited by Francisco Azevedo, Pedro Barahona, François Fages, Francesca Rossi. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2007. 
300 |a VIII, 188 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 4651 
505 0 |a Tutorial -- Hybrid Algorithms in Constraint Programming -- Technical Papers -- An Attempt to Dynamically Break Symmetries in the Social Golfers Problem -- A Constraint Model for State Transitions in Disjunctive Resources -- Reusing CSP Propagators for QCSPs -- Bipolar Preference Problems: Framework, Properties and Solving Techniques -- Distributed Forward Checking May Lie for Privacy -- Solving First-Order Constraints in the Theory of the Evaluated Trees -- Extracting Microstructure in Binary Constraint Networks -- Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees -- Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems -- Cost-Based Filtering for Stochastic Inventory Control. 
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 Logics and Meanings of Programs. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Numeric Computing. 
650 2 4 |a Mathematical Logic and Formal Languages. 
700 1 |a Azevedo, Francisco.  |e editor. 
700 1 |a Barahona, Pedro.  |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 9783540738169 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4651 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-73817-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)