Sciweavers

2861 search results - page 213 / 573
» Parallel Online Learning
Sort
View
IEEEPACT
2009
IEEE
15 years 10 months ago
StealthTest: Low Overhead Online Software Testing Using Transactional Memory
—Software testing is hard. The emergence of multicore architectures and the proliferation of bugprone multithreaded software makes testing even harder. To this end, researchers h...
Jayaram Bobba, Weiwei Xiong, Luke Yen, Mark D. Hil...
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
15 years 9 months ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
ASPLOS
2004
ACM
15 years 9 months ago
Devirtualizable virtual machines enabling general, single-node, online maintenance
Maintenance is the dominant source of downtime at high availability sites. Unfortunately, the dominant mechanism for reducing this downtime, cluster rolling upgrade, has two short...
David E. Lowell, Yasushi Saito, Eileen J. Samberg
ICALP
2004
Springer
15 years 9 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
SCHEDULING
2011
14 years 11 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs...
Michael Gatto, Peter Widmayer