Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eļ¬...
Data integration is a signiļ¬cant challenge: relevant data objects are split across multiple information sources, and often owned by different organizations. The sources represent...
This paper presents a study of diļ¬erent models for the growth curves and takeover time in a distributed EA (dEA). The calculation of the takeover time and the dynamical growth cu...
In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite...
Gerry V. Dozier, Hurley Cunningham, Winard Britt, ...