Your search for 38411 returns 3079 document(s) |
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
|
Search and inference in AI planning, (LNCS-Lecture Notes in Computer Science 3709) Hal 1-4 |
Author: Hector Geffner; | 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 large-scale nonlinear programming problems by constraint partitioning, (LNCS-Lecture Notes in Computer Science 3709) Hal 697-711 |
Author: Benjamin W. Wah; Yixin Chen; | 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
|
And/or branch-and-bound for solving mixed integer linear programming problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 857 |
Author: Radu Marinescu; Rina Dechter; | 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
|
Caching search states in permutation problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 637-651 |
Author: Barbara M. Smith; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Extending systematic local search for job shop scheduling problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 762-766 |
Author: Bistra Dilkina; Lei Duan; William S. Havens; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Constraint-based inference: a bridge between constraint processing and probability inference, (LNCS-Lecture Notes in Computer Science 3709) Hal 844 |
Author: Le Chang; Alan K. Mackworth; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|