| Your search for 38437 returns 2584 document(s) |
| 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
|
| 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 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 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
|
| 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
|
| Using sat in qbf, (LNCS-Lecture Notes in Computer Science 3709) Hal 578-592 |
|
Author: Horst Samulowitz; Fahiem Bacchus; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Lookahead saturation with restriction for sat, (LNCS-Lecture Notes in Computer Science 3709) Hal 727-731 |
|
Author: Anbulagan; John Slaney; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Neighbourhood clause weight redistribution in local search for sat, (LNCS-Lecture Notes in Computer Science 3709) Hal 772-776 |
|
Author: Abdelraouf Ishtaiwi; John Thornton; Abdul Sattar; Duc Nghia Pham; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Search Result