A new incremental knowledge acquisition approach for the effective development of efficient problem solvers for combinatorial problems based on probabilistic search algorithms is ...
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...
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...
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...
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 ...