| Your search for 38446 returns 4594 document(s) |
| Domain reduction for the circuit constraint, (LNCS-Lecture Notes in Computer Science 3709) Hal 846 |
|
Author: Latife Genc Kaya; John Hooker; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Modeling constraint programs with software technology standards, (LNCS-Lecture Notes in Computer Science 3709) Hal 850 |
|
Author: Matthias Hoche; Stefan Jahnichen; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Solution equivalent subquadrangle reformulations of constraint satisfaction problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 851 |
|
Author: Chris Houghton; David Cohen; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| And/or search spaces and the semantic width of constraint networks, (LNCS-Lecture Notes in Computer Science 3709) Hal 860 |
|
Author: Robert Mateescu; Rina Dechter; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Randomization for multi-agent constraint optimization, (LNCS-Lecture Notes in Computer Science 3709) Hal 864 |
|
Author: Quang Huy Nguyen; Boi V. Faltings; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| From linear relaxations to global constraint propagation, (LNCS-Lecture Notes in Computer Science 3709) Hal 867 |
|
Author: Claude-Guy Quimper; Alejandro Lopez-Ortiz; | 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
|
| Solving simple planning problems with more inference and no search, (LNCS-Lecture Notes in Computer Science 3709) Hal 682-696 |
|
Author: Vincent Vidal; Hector Geffner; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Solving over-constrained problems with sat, (LNCS-Lecture Notes in Computer Science 3709) Hal 838 |
|
Author: Josep Argelich; Felip Manya; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| The role of redundant clauses in solving satisfiability problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 873 |
|
Author: Honglei Zeng; Sheila McIlraith; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Search Result