2487 search results - page 326 / 498 » cases 2009 |
139
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
100
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
As an immune inspired algorithm, the Dendritic Cell Algorithm (DCA) has been applied to a range of problems, particularly in the area of intrusion detection. Ideally, the intrusio...
111
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
The paper deals with optimization of collective communications on multistage interconnection networks (MINs). In the experimental work, unidirectional MINs like Omega, Butterfly a...
ICB
2009
Springer
15 years 7 months ago
2009
Springer
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...
95
Voted
ICCS
2009
Springer
15 years 7 months ago
2009
Springer
We present the living application, a method to autonomously manage applications on the grid. During its execution on the grid, the living application makes choices on the resources...