| Your search for 38316 returns 2749 document(s) |
| Inter-distance constraint: an extension of the all-different constraint for scheduling equal length jobs, (LNCS-Lecture Notes in Computer Science 3709) Hal 62-76 |
|
Author: Konstantin Artiouchine; Philippe Baptiste; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Planning complex updates to satisfy constraint rules using a constraint logic search engine (LNCS-Lecture Notes in Computer Science 985) |
|
Author: Suzanne M. Embury, Peter M.D. Gray; | Call Number: 004 Rul | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Parallel quasi-monte carlo integration using (t,s)-sequences, (LNCS-Lecture Notes in Computer Science 1557) Hal 96-106 |
|
Author: Wolfgang CH. Schmid; Andreas Uhl; | Call Number: 004.35 Par | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| An integration of model checking with automated proof checking, (LNCS-Lecture Notes in Computer Science 939) Hal 84-97 |
|
Author: S. Rajan; N. Shankar; M. K. Srivas; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| The integration of LOTOS with an object oriented development method, (LNCS-Lecture Notes in Computer Science 670) Hal 73-82 |
|
Author: Mikael Hedlund; | Call Number: 004 Woo f | 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
|
| On solving soft temporal constraints using sat techniques, (LNCS-Lecture Notes in Computer Science 3709) Hal 607-621 |
|
Author: Hossein M. Sheini; Bart Peintner; Karem A. Sakallah; Martha E. Pollack; | 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
|
| Solving the car-sequencing problem as a non-binary CSP, (LNCS-Lecture Notes in Computer Science 3709) Hal 840 |
|
Author: Mihaela Butaru; Zineb Habbas; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Search Result