19700 search results - page 207 / 3940 » DNA-Based Computation Times |
147
Voted
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for ...
138
click to vote
WABI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
130
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
169
Voted
WDAG
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
138
click to vote
GRID
2006
Springer
15 years 5 months ago
2006
Springer
In this work we report on data gathered via a deployment of a monitoring and benchmarking infrastructure on two production grid platforms, TeraGrid and Geon. Our result show that t...