Sciweavers

1884 search results - page 214 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
AAAI
2008
15 years 8 months ago
How Good is Almost Perfect?
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 ...
Malte Helmert, Gabriele Röger
170
Voted
FIMI
2003
88views Data Mining» more  FIMI 2003»
15 years 7 months ago
A fast APRIORI implementation
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...
Ferenc Bodon
VG
2003
15 years 7 months ago
Cell Projection of Convex Polyhedra
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...
Stefan Röttger, Thomas Ertl
ECRTS
2010
IEEE
15 years 6 months ago
Improved Tardiness Bounds for Global EDF
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...
COR
2007
80views more  COR 2007»
15 years 6 months ago
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
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...