Search Result Save to File Save as CSV
Your search for 38392 returns 2461 document(s)
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 
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 
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 
Bounds of graph characteristics, (LNCS-Lecture Notes in Computer Science 3709) Hal 742-746
Author: Nicolas Beldiceanu; Thierry Petit; Guillaume Rochart; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Eplex: Harnessing mathematical programming solvers for constraint logic programming, (LNCS-Lecture Notes in Computer Science 3709) Hal 622-636
Author: Kish Shen; Joachim Schimpf; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Speeding up constrained path solvers with a reachability propagator, (LNCS-Lecture Notes in Computer Science 3709) Hal 866
Author: Luis Quesada; Peter Van Roy; Yves Deville; | 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 
Bounds-consistent local search, (LNCS-Lecture Notes in Computer Science 3709) Hal 870
Author: Stefania Verachi; Steven Prestwich; | 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 
From linear relaxations to global constraint propagation, (LNCS-Lecture Notes in Computer Science 3709) Hal 867
Author: Claude-Guy Quimper; Alejandro Lopez-Ortiz; | 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