4639 search results - page 125 / 928 » A General Method for Errors-in-Variables Problems in Compute... |
CVBIA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We present a method for finding the boundaries between adjacent regions in an image, where “seed” areas have already been identified in the individual regions to be...
GECCO
2010
Springer
14 years 28 days ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
AUTOMATICA
2008
13 years 9 months ago
2008
: For an infinite-horizon optimal control problem, the cost does not, in general, converge. The classical work-around to this problem is to introduce a discount or "forgetting...
ANOR
2002
13 years 8 months ago
2002
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...
GECCO
2006
Springer
14 years 17 days ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...