92 search results - page 16 / 19 » Evolving heuristically difficult instances of combinatorial ... |
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...