| Your search for 38404 returns 3545 document(s) |
| 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
|
| 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
|
| 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
|
| 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
|
| Local consistency in weighted CSPs and inference in max-sat, (LNCS-Lecture Notes in Computer Science 3709) Hal 849 |
|
Author: Federico Heras; Javier Larrosa; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Exploiting unit propagation to compute lower bounds in branch and bound max-sat solvers, (LNCS-Lecture Notes in Computer Science 3709) Hal 403-414 |
|
Author: Chu Min Li; Felip Manya; Jordi Planes; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Using boolean constraint propagation for sub-clauses deduction, (LNCS-Lecture Notes in Computer Science 3709) Hal 757-761 |
|
Author: S. Darras; G. Dequen; L. Devendeville; B. Mazure; R. Ostrowski; L. Sais; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Dimensioning an inbound call center using constraint programming, (LNCS-Lecture Notes in Computer Science 3709) Hal 841 |
|
Author: Cyril Canon; Jean-Charles Billaut; Jean-Louis Bouquard; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
| Using Constraint programming for solving distance CSP with uncertainty, (LNCS-Lecture Notes in Computer Science 3709) Hal 847 |
|
Author: Carlos Grandon; Bertrand Neveu; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Search Result