3656 search results - page 118 / 732 » Compact Location Problems |
147
click to vote
COR
2008
15 years 10 days ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
124
Voted
ASIAN
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
122
click to vote
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
We propose a novel approach to point matching under large viewpoint and illumination changes that is suitable for accurate object pose estimation at a much lower computational cos...
100
click to vote
ICDCS
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
98
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. This paper describes the application of four evolutionary algorithms to the pruning of neural networks used in classification problems. Besides of a simple genetic algor...