Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for v...
Anna Bretscher, Derek G. Corneil, Michel Habib, Ch...
Web services are distributed processes with a public description of their behavior, or contract. The availability of repositories of Web service descriptions enables interesting f...
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...