GECCO
2005
Springer
14 years 5 months ago
2005
Springer
Evolutionary Algorithms (EAs), popular search methods for solving search and optimization problems, are known for successful and fast location of single optimal solutions. However,...
GECCO
2005
Springer
14 years 5 months ago
2005
Springer
When applied to optimization problems, Cooperative Coevolutionary Algorithms (CCEA) have been observed to exhibit a behavior called relative overgeneralization. Roughly, they tend...
GD
2005
Springer
14 years 5 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
EVOW
2005
Springer
14 years 5 months ago
2005
Springer
This work presents an evolutionary approach to improve the infection algorithm to solve the problem of dense stereo matching. Dense stereo matching is used for 3D reconstruction in...
EVOW
2005
Springer
14 years 5 months ago
2005
Springer
Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in ord...
EVOW
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. Evolutionary algorithms are powerful tools in search and optimization tasks with several applications in complex engineering problems. However, setting all associated par...
EUROPAR
2005
Springer
14 years 5 months ago
2005
Springer
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
EUROPAR
2005
Springer
14 years 5 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
EUC
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...