We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
Abstract. We have investigated the adaptation of AI-based search techniques as topologyindependent fault-tolerant routing strategies on multiprocessor networks [9]. The results sho...
To successfully search multiple coadaptive subcomponents in a solution, we developed a novel cooperative evolutionary algorithm based on a new computational multilevel selection f...
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...