Your search for 15639 returns 2576 document(s) |
A Sat based approach for solving formulas over boolean and linear mathematical propositions, Hal. 193-210 |
Author: Gilles Audemard; Piergiorgio Bertoli, Alessandro Cimatti; | Call Number: SEM-281 | Type: Indeks Artikel prosiding/Sem
|
Find Similar |
Add To Favorites |
Detail in New Window
|
The effect of jacobian evaluation reduction in solving stiff system of initial value problems (IVPS) for ordinary differential equations (ODES),Hal 131-138 |
Author: Heru Suhartanto; | Call Number: SEM-200 | Type: Indeks Artikel prosiding/Sem
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Plenary speech toward challenging computational intelligence application for solving our nation problem, Hal. 1-2 |
Author: Muhammad Nuh; | Call Number: SEM-303 | Type: Indeks Artikel prosiding/Sem
|
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 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
|
Computing and exploiting tree-decompositions for solving constraint networks, (LNCS-Lecture Notes in Computer Science 3709) Hal 777-781 |
Author: Philippe Jegou; Samba Ndojh Ndiaye; Cyril Terrioux; | 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
|