Search Result Save to File Save as CSV
Your search for 38456 returns 3565 document(s)
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 
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 
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 
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 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 
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 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 
Implementing deductive databases by mixed integer programming
Author: Colin Bell | Type: Indeks Artikel Jurnal
Find Similar |  Add To Favorites |  Detail in New Window 
Programming with TOY (FD), (LNCS-Lecture Notes in Computer Science 3709) Hal 878
Author: Antonio J. Fernandez; Teresa Hortala-Gonzalez; Fernando Saenz-Perez; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Prev   1 2 3 4 5 6 7 8 9 10  Next