Sciweavers

1740 search results - page 324 / 348
» Minimal structures for stories
Sort
View
ICALP
2004
Springer
14 years 3 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
VEE
2010
ACM
238views Virtualization» more  VEE 2010»
14 years 2 months ago
Optimizing crash dump in virtualized environments
Crash dump, or core dump is the typical way to save memory image on system crash for future offline debugging and analysis. However, for typical server machines with likely abund...
Yijian Huang, Haibo Chen, Binyu Zang
HICSS
2003
IEEE
132views Biometrics» more  HICSS 2003»
14 years 2 months ago
Markets for Reliability and Financial Options in Electricity: Theory to Support the Practice
The underlying structure of why and how consumers value reliability of electric service is explored, together with the technological options and cost characteristics for the provi...
Timothy Mount, William Schulze, Richard E. Schuler
INFOCOM
2003
IEEE
14 years 2 months ago
S-MIP: A Seamless Handoff Architecture for Mobile IP
—As the number of Mobile IP (MIP) [2] users grow, so will the demand for delay sensitive real-time applications, such as audio streaming, that require seamless handoff, namely, a...
Robert Hsieh, Zhe Guang Zhou, Aruna Seneviratne
ISPASS
2003
IEEE
14 years 2 months ago
Performance study of a cluster runtime system for dynamic interactive stream-oriented applications
Emerging application domains such as interactive vision, animation, and multimedia collaboration display dynamic scalable parallelism, and high computational requirements, making ...
Arnab Paul, Nissim Harel, Sameer Adhikari, Bikash ...