Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the po...
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...
This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossov...
Abstract— We recast the problem of unconstrained continuous evolutionary optimization as inference in a fixed graphical model. This approach allows us to address several pervasi...
Christopher K. Monson, Kevin D. Seppi, James L. Ca...