Sciweavers

2313 search results - page 226 / 463
» On Heuristic Time Hierarchies
Sort
View
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
16 years 23 days ago
Credit assignment in adaptive memetic algorithms
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...
J. E. Smith
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
16 years 23 days ago
A leader-based parallel cross entropy algorithm for MCP
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...
Zhanhua Bai, Qiang Lv
DOCENG
2006
ACM
16 years 18 days ago
Fast and simple XML tree differencing by sequence alignment
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...
Tancred Lindholm, Jaakko Kangasharju, Sasu Tarkoma
ICSM
2005
IEEE
16 years 6 days ago
The Top Ten List: Dynamic Fault Prediction
To remain competitive in the fast paced world of software development, managers must optimize the usage of their limited resources to deliver quality products on time and within b...
Ahmed E. Hassan, Richard C. Holt
ATAL
2005
Springer
16 years 5 days ago
Modeling complex multi-issue negotiations using utility graphs
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...