14548 search results - page 331 / 2910 » The Optimal Path-Matching Problem |
196
Voted
APIN
1999
15 years 6 months ago
1999
The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on re...
220
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
Abstract—Although femtocell deployments in residential buildings have been increasingly prevalent, femtocell deployment in commercial building environments remains in its infancy...
148
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goa...
165
click to vote
EVOW
2005
Springer
16 years 6 days ago
2005
Springer
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
155
click to vote
ORL
2006
15 years 6 months ago
2006
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...