701 search results - page 114 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
DAM
2011
13 years 2 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
TROB
2008
13 years 7 months ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
GECCO
2010
Springer
13 years 10 months ago
2010
Springer
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...