1191 search results - page 129 / 239 » Completeness and Performance Of The APO Algorithm |
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
WDAG
2000
Springer
15 years 1 months ago
2000
Springer
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
DICTA
2003
14 years 11 months ago
2003
This paper presents a novel approach for estimating the flow fields of dynamic temporal textures whose motion differs radically from that of rigid bodies. Our approach is based o...
BMCBI
2007
14 years 10 months ago
2007
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...