3433 search results - page 298 / 687 » Heuristics for a bidding problem |
183
click to vote
GECCO
2007
Springer
16 years 28 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...
169
click to vote
GECCO
2007
Springer
16 years 28 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...
169
click to vote
ICCS
2007
Springer
16 years 28 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...
114
click to vote
GLOBECOM
2006
IEEE
16 years 25 days ago
2006
IEEE
Abstract— Many emerging applications for peer to peer overlays may require nodes to satisfy strict timing deadlines to access a replica of a given object. This includes multimedi...
186
click to vote
DOCENG
2006
ACM
16 years 22 days ago
2006
ACM
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...