Search Result Save to File Save as CSV
Your search for 38375 returns 2660 document(s)
Beyond hypertree width: decomposition methods without decompositions, (LNCS-Lecture Notes in Computer Science 3709) Hal 167-181
Author: Hubie Chen; Victor Dalmau; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Computing and exploiting tree-decompositions for solving constraint networks, (LNCS-Lecture Notes in Computer Science 3709) Hal 777-781
Author: Philippe Jegou; Samba Ndojh Ndiaye; Cyril Terrioux; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Beyond finite domains: the all different and global cardinality constraints, (LNCS-Lecture Notes in Computer Science 3709) Hal 812-816
Author: Claude-Guy Quimper; Toby Walsh; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Maintaining arc consistency algorithms during the search without additional space cost, (LNCS-Lecture Notes in Computer Science 3709) Hal 520-533
Author: Jean-Charles Regin; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Repair-based methods for quantified CSPs, (LNCS-Lecture Notes in Computer Science 3709) Hal 652-666
Author: Kostas Stergiou; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Applying decomposition methods to crossword puzzle problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 874
Author: Yaling Zheng; Berthe Y. Choueiry; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Certificateless signature scheme without random oracles,(LNCS-Lecture Notes in Computer Science 5576) Hal. 31-40
Author: Vineela Muppavarapu ad Soon M. Chung; | Call Number: 005.8 Adv | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Aggregate and verifiably encrypted signatures from multilinear maps without random oracles, (LNCS-Lecture Notes in Computer Science 5576) Hal 750-759
Author: Markus Ruckert; Dominique Schroder; | Call Number: 005.8 Adv | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Open key exchange: how to defeat dictionary attacks without encrypting public keys, (LNCS-Lecture Notes in Computer Science 939) Hal 79-90
Author: Stefan Lucks; | Call Number: 004.62 Chr s | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Methods for mu-calculus model checking: a tutorial, (LNCS-Lecture Notes in Computer Science 939) Hal 141
Author: E. A. Emerson; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Prev   1 2 3 4 5 6 7 8 9 10  Next