Sciweavers

3367 search results - page 40 / 674
» Incremental assignment problem
Sort
View
EKAW
2004
Springer
15 years 3 months ago
Incremental Knowledge Acquisition for Improving Probabilistic Search Algorithms
A new incremental knowledge acquisition approach for the effective development of efficient problem solvers for combinatorial problems based on probabilistic search algorithms is ...
J. P. Bekmann, Achim G. Hoffmann
COR
2011
14 years 4 months ago
Size-reduction heuristics for the unrelated parallel machines scheduling problem
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job di...
Luis Fanjul-Peyro, Rubén Ruiz
FOCS
1999
IEEE
15 years 2 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
CSR
2006
Springer
15 years 1 months ago
Incremental Branching Programs
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
Anna Gál, Michal Koucký, Pierre McKe...
SAT
2004
Springer
111views Hardware» more  SAT 2004»
15 years 3 months ago
A Note on Satisfying Truth-Value Assignments of Boolean Formulas
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...
Zbigniew Stachniak