Your search for 38464 returns 2601 document(s) |
Breaking all value symmetries in surjection problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 490-504 |
Author: Jean-Francois Puget; | 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
|
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
|
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
|
Distributed constraints for large-scale scheduling problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 837 |
Author: Montserrat Abril; Miguel A. Salido; Federico Barber; | 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
|
Specialised constraints for stable matching problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 869 |
Author: Chris Unsworth; Patrick Prosser; | 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
|
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
|