We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
The Dagstuhl Seminar Similarity-based Clustering and its Application to Medicine and Biology (07131) held in March 25–30, 2007, provided an excellent atmosphere for in-depth disc...
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...