Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
This work studies the mGA operator (Micro Genetic Algorithm), that has been proposed in literature as a “local search” operator for optimization with Genetic Algorithm. A new ...
Abstract Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in nat...
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...