3758 search results - page 97 / 752 » A Complete Subsumption Algorithm |
ANTS
2010
Springer
14 years 1 months ago
2010
Springer
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
ESA
2006
Springer
14 years 1 months ago
2006
Springer
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
CLA
2007
13 years 11 months ago
2007
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. In earlier work, the Abstract State Machine Thesis — that arbitrary algore behaviorally equivalent to abstract state machines — was established for several classes of...