3758 search results - page 78 / 752 » A Complete Subsumption Algorithm |
178
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
167
Voted
ICALP
2007
Springer
16 years 21 days ago
2007
Springer
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
143
Voted
FSKD
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. Some comparable experiments have been completed in o...
153
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The F5 algorithm is presented by Faug`ere in 2002. However, Faug`ere have not provide the rigorous proofs so far. In this paper, we will give a new complete proof and hence reveal ...
158
click to vote
IPPS
2006
IEEE
16 years 17 days ago
2006
IEEE
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorith...