3758 search results - page 75 / 752 » A Complete Subsumption Algorithm |
125
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the no...
104
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on the wires of a reversible circuit. We also show non-trivial lower bounds for the ...
113
click to vote
APLAS
2000
ACM
15 years 6 months ago
2000
ACM
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
113
click to vote
WDAG
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
PPL
2007
15 years 1 months ago
2007
In this work we are interested in the problem of scheduling and redistributing data on master-slave platforms. We consider the case were the workers possess initial loads, some of...