14548 search results - page 361 / 2910 » The Optimal Path-Matching Problem |
184
click to vote
DEXAW
2008
IEEE
16 years 1 months ago
2008
IEEE
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
162
click to vote
PPAM
2007
Springer
16 years 25 days ago
2007
Springer
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized c...
283
click to vote
APPROX
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
159
click to vote
GECCO
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. When direct measurement of model parameters is not possible, these need to be inferred indirectly from calibration data. To solve this inverse problem, an algorithm that ...
188
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...