Sciweavers

1792 search results - page 57 / 359
» Improved scheduling in rings
Sort
View
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 11 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
XPU
2010
Springer
13 years 8 months ago
Put It to the Test: Using Lightweight Experiments to Improve Team Processes
Experimentation is one way to gain insight into how processes perform for a team, but industry teams rarely do experiments, fearing that such educational excursions will incur extr...
Michael Keeling
JSSPP
2005
Springer
14 years 3 months ago
Wave Scheduler: Scheduling for Faster Turnaround Time in Peer-Based Desktop Grid Systems
The recent success of Internet-based computing projects, coupled with rapid developments in peer-to-peer systems, has stimulated interest in the notion of harvesting idle cycles u...
Dayi Zhou, Virginia Mary Lo
SIGSOFT
2000
ACM
14 years 2 months ago
The universe model: an approach for improving the modularity and reliability of concurrent programs
We present the universe model,a new approach to concurrencymanagement that isolates concurrency concerns and represents them in the modular interface of a component. This approach...
Reimer Behrends, Kurt Stirewalt
FSE
2000
Springer
101views Cryptology» more  FSE 2000»
14 years 1 months ago
Improved Cryptanalysis of Rijndael
We improve the best attack on Rijndael reduced to 6 rounds from complexity 272 to 244 . We also present the first known attacks on 7- and 8-round Rijndael. The attacks on 8-round R...
Niels Ferguson, John Kelsey, Stefan Lucks, Bruce S...