272 search results - page 46 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
184
Voted
OL
2011
14 years 10 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
127
Voted
IJRR
2007
15 years 3 months ago
2007
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
126
Voted
EVOW
2012
Springer
13 years 11 months ago
2012
Springer
This paper presents HyFlex, a software framework for the development of cross-domain search methodologies. The framework features a common software interface for dealing with diff...
157
Voted
CEC
2011
IEEE
14 years 3 months ago
2011
IEEE
—Despite the range of applications and successes of evolutionary algorithms, expensive fitness computations often form a critical performance bottleneck. A preferred method of r...
149
Voted
DAM
2011
14 years 10 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...