Your search for 38373 returns 2485 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
|
Ad-hoc global constraints for life, (LNCS-Lecture Notes in Computer Science 3709) Hal 182-195 |
Author: Kenil C.K. Cheng; Roland H.C. Yap; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Tractable clones of polynomials over semigroups, (LNCS-Lecture Notes in Computer Science 3709) Hal 196-210 |
Author: Victor Dalmau; Ricard Gavalda; Pascal Tesson; Denis Therien; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Assumption-based pruning in conditional CSP, (LNCS-Lecture Notes in Computer Science 3709) Hal 241-255 |
Author: Felix Geller; Michael Veksler; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Solving the MOLR and social golfers problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 286-300 |
Author: Warwick Harvey; Thorsten Winterer; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Advances in polytime isomorph elimination for configuration, (LNCS-Lecture Notes in Computer Science 3709) Hal 301-313 |
Author: Laurent Henocque; Mathias Kleiner; Nicolas Prcovic; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Planning and scheduling to minimize tardiness, (LNCS-Lecture Notes in Computer Science 3709) Hal 314-327 |
Author: J.N. Hooker; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Seacrh heuristics and heavy-tailed behaviour, (LNCS-Lecture Notes in Computer Science 3709) Hal 328-342 |
Author: Tudor Hulubei; Barry O'Sullivan; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Maintaining longest paths in cyclic graphs, (LNCS-Lecture Notes in Computer Science 3709) Hal 358-372 |
Author: Irit Katriel; Pascal Van Hentenryck; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Generalized conflict learning for hybrid discrete/linear optimization, (LNCS-Lecture Notes in Computer Science 3709) Hal 415-429 |
Author: Hui Li; Brian Williams; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|