250 search results - page 5 / 50 » General variable neighborhood search for the continuous opti... |
IEICET
2007
14 years 9 months ago
2007
—When SA is applied to continuous optimization problems, the design of the neighborhood used in SA becomes important. A lot of experiments are necessary to determine an appropria...
71
Voted
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper proposes a general framework for searching large distributed repositories. Examples of such repositories include sites with music/video content, distributed digital lib...
89
Voted
JCO
2007
14 years 9 months ago
2007
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
HM
2009
Springer
15 years 2 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
ALMOB
2006
14 years 9 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...