1933 search results - page 70 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
145
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
125
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
151
click to vote
ALGORITHMICA
2006
15 years 3 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
137
Voted
RAS
2008
15 years 2 months ago
2008
In this paper, we tackle the problem of unsupervised selection and posterior recognition of visual landmarks in images sequences acquired by an indoor mobile robot. This is a high...
141
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded lo...