In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
Domain knowledge is essential for successful problem solving and optimization. This paper introduces a framework in which a form of automatic domain knowledge extraction can be im...
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide t...
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
A coterie is a family of subsets such that every pair of subsets in it has at least one element in common but neither is a subset of the other. We introduce an operator , which
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
Recent advances in high-speed networks, rapid improvements in microprocessor design, and availability of highly performing clustering software implementations enables cost-effecti...
Ghassan Fadlallah, Michel Lavoie, Louis-A. Dessain...
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...