Recent Advances in Constraints Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, Uppsala, Sweden, June 20-22, 2005, Revised Selected and Invited Papers /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Hnich, Brahim (Επιμελητής έκδοσης), Carlsson, Mats (Επιμελητής έκδοσης), Fages, François (Επιμελητής έκδοσης), Rossi, Francesca (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Σειρά:Lecture Notes in Computer Science, 3978
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03146nam a22005895i 4500
001 978-3-540-34216-8
003 DE-He213
005 20170107100124.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 |a 9783540342168  |9 978-3-540-34216-8 
024 7 |a 10.1007/11754602  |2 doi 
040 |d GrThAP 
050 4 |a HD9696.2-9696.82 
072 7 |a KNTX  |2 bicssc 
072 7 |a BUS070030  |2 bisacsh 
082 0 4 |a 338.47004  |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 2005, Uppsala, Sweden, June 20-22, 2005, Revised Selected and Invited Papers /  |c edited by Brahim Hnich, Mats Carlsson, François Fages, Francesca Rossi. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2006. 
300 |a VIII, 179 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 3978 
505 0 |a Global Constraints -- The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables -- Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains -- Among, Common and Disjoint Constraints -- Search and Heuristics -- Partitioning Based Algorithms for Some Colouring Problems -- A CSP Search Algorithm with Reduced Branching Factor -- Analysis of Heuristic Synergies -- Complexity Analysis of Heuristic CSP Search Algorithms -- Language and Implementation Issues -- A Type System for CHR -- Views and Iterators for Generic Constraint Implementations -- Modeling -- A Hybrid Benders’ Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse -- The Challenge of Exploiting Weak Symmetries -- On Generators of Random Quasigroup Problems. 
650 0 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 0 |a Artificial intelligence. 
650 0 |a Computer industry. 
650 1 4 |a Computer Science. 
650 2 4 |a The Computer Industry. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Software Engineering/Programming and Operating Systems. 
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. 
700 1 |a Hnich, Brahim.  |e editor. 
700 1 |a Carlsson, Mats.  |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 9783540342151 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3978 
856 4 0 |u http://dx.doi.org/10.1007/11754602  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)