| Your search for 38436 returns 2833 document(s) |
| Proterv-II: an integrated production planning and scheduling system, (LNCS-Lecture Notes in Computer Science 3709) Hal 880 |
|
Author: Andras Kovacs; Peter Egri; Tamas Kis; Jozsef Vancza; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Symmetry definitions for constraint satisfaction problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 17-31 |
|
Author: David Cohen; Peter Jeavons; Christopher Jefferson; Karen E. Petrie; Barbara M. Smith; | 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
|
| 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
|
| Consistency for quantified constraint satisfaction problems, (LNCS-Lecture Notes in Computer Science 3709) Hal 792-796 |
|
Author: Peter Nightingale; | 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
|
| 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 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
|
Search Result