Your search for 38414 returns 2330 document(s) |
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
|
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
|
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
|
On the relation between answer set and sat procedures (or, between cmodels and smodels),(LNCS-Lecture Notes in Computer Science 3668) Hal 37-51 |
Author: Enrico Giunchiglia; Marco Maratea; | Call Number: 005.133 Gab l | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Run-time performance optimization of an FPGA-based deduction engine for SAT solvers, (LNCS-Lecture Notes in Computer Science 2147) Hal 315-325 |
Author: Andreas Dandalis; Viktor K. Prasanna; Bharani Thiruvengadam; | Call Number: 005.115 Fie | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Preference reasoning, (LNCS-Lecture Notes in Computer Science 3709) Hal 9-12 |
Author: Francesca Rossi; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|