Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
NK models provide a family of tunably rugged fitness landscapes used in a wide range of evolutionary computation studies. It is well known that the average height of local optima...
Benjamin Skellett, Benjamin Cairns, Nicholas Geard...
Abstract. To generalize the Fisher Discriminant Analysis (FDA) algorithm to the case of discriminant functions belonging to a nonlinear, finite dimensional function space F (Nonli...
A methodology needs to be empowered by appropriate tool support. The CASE tool ArgoUWE supports designers in the use of the UWE methodology for the systematic, UML-based developmen...
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...