1101 search results - page 90 / 221 » heuristics 2007 |
161
click to vote
EVOW
2007
Springer
16 years 16 days ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
175
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
269
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
159
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
158
click to vote
ICCS
2007
Springer
16 years 16 days ago
2007
Springer
This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, wh...