Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
Finite element methods commonly use unstructured grids as the computational domain. As a matter of fact, the volume visualization of these unstructured grids is a time consuming t...
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the ma...
Jeremy P. Erickson, UmaMaheswari Devi, Sanjoy K. B...
In this paper we present an ant-based algorithm for solving unconstrained multi-level lot-sizing problems called ant system for multi-level lot-sizing algorithm (ASMLLS). We apply...
Rapeepan Pitakaso, Christian Almeder, Karl F. Doer...