3142 search results - page 481 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
GECCO
2000
Springer
14 years 2 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
GECCO
2008
Springer
13 years 12 months ago
2008
Springer
In evolutionary computation, experimental results are commonly analyzed using an algorithmic performance metric called best-so-far. While best-so-far can be a useful metric, its u...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it ...
DATE
2008
IEEE
14 years 5 months ago
2008
IEEE
Abstract—Embedded system secondary storage size is often constrained, yet storage demands are growing as a result of increasing application complexity and storage of personal dat...
UIST
2006
ACM
14 years 4 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...