Sciweavers

849 search results - page 4 / 170
» The Early Restart Algorithm
Sort
View
WDAG
1997
Springer
106views Algorithms» more  WDAG 1997»
14 years 3 months ago
Performing Tasks on Restartable Message-Passing Processors
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
Bogdan S. Chlebus, Roberto De Prisco, Alexander A....
ICALP
2004
Springer
14 years 4 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...
RTCSA
1999
IEEE
14 years 3 months ago
Dynamic Adjustment of Serialization Order Using Timestamp Intervals in Real-Time Databases
Although an optimistic approach has been shown to be better than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and heavy re...
Jan Lindström, Kimmo E. E. Raatikainen
GECCO
2009
Springer
127views Optimization» more  GECCO 2009»
14 years 3 months ago
BBOB-benchmarking the Rosenbrock's local search algorithm
The restarted Rosenbrock’s optimization algorithm is tested on the BBOB 2009 testbed. The algorithm turned out to be very efficient for functions with simple structure (independ...
Petr Posik
IPL
2008
80views more  IPL 2008»
13 years 11 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra