Abstract- The complexity of the static scheduling problem on heterogeneous resources has motivated the development of low complexity heuristics such as list scheduling. However, th...
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
Abstract. We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton. Then the algorithms searches for the corresponding subshift attractors...
Enrico Formenti, Petr Kurka, Ondrej Zahradní...
Scaling conformant planning is a problem that has received much attention of late. Many planners solve the problem as a search in the space of belief states, and some heuristic gu...
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...