Sciweavers

804 search results - page 40 / 161
» On the Termination of the Chase Algorithm
Sort
View
102
Voted
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 7 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
BIBM
2008
IEEE
105views Bioinformatics» more  BIBM 2008»
15 years 7 months ago
Energy Profile and Secondary Structure Impact shRNA Efficacy
Many characteristics of functional synthetic siRNAs have been identified. Our three-phase algorithm was developed to design siRNA on a wholegenome scale based on these characteris...
Hong Zhou, Xiao Zeng
102
Voted
SIGMETRICS
2004
ACM
124views Hardware» more  SIGMETRICS 2004»
15 years 5 months ago
Interposed proportional sharing for a storage service utility
This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resou...
Wei Jin, Jeffrey S. Chase, Jasleen Kaur
104
Voted
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 17 days ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
94
Voted
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
15 years 9 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski