31 search results - page 2 / 7 » Optimality of an algorithm solving the Bottleneck Tower of H... |
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
TMC
2012
11 years 7 months ago
2012
—Sensor networks nowadays are widely used for structural health monitoring; for example, the sensor monitoring system deployed on the Guangzhou New TV Tower, China. While wired s...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
CPM
2009
Springer
13 years 2 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
EDBT
2011
ACM
12 years 8 months ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...