Sciweavers

2497 search results - page 146 / 500
» Requirements for models of achievable routing
Sort
View
RTSS
2002
IEEE
15 years 6 months ago
State-Dependent Deadline Scheduling
This paper presents a new workload model, called the state-dependent deadline model, for applications whose high-level timing requirements may change with time. The problem is how...
Chi-Sheng Shih, Jane W.-S. Liu
DSS
2007
76views more  DSS 2007»
15 years 1 months ago
Deadline-based escalation in process-aware information systems
Process-aware information systems are typically driven by process models capturing an idealized view of the actual processes. For example, most process models assume that planned ...
Wil M. P. van der Aalst, Michael Rosemann, Marlon ...
109
Voted
WSC
2008
15 years 4 months ago
How to build better models: Applying agile techniques to simulation
For simulation practitioners, the common steps in a simulation modeling engagement are likely familiar: problem assessment, requirements specification, model building, verificatio...
James T. Sawyer, David M. Brann
PODC
1997
ACM
15 years 6 months ago
Dynamic Wavelength Allocation in Optical Networks
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
Ornan Ori Gerstel, Galen H. Sasaki, Shay Kutten, R...
WACV
2008
IEEE
15 years 8 months ago
Background Subtraction for Temporally Irregular Dynamic Textures
In the traditional mixture of Gaussians background model, the generating process of each pixel is modeled as a mixture of Gaussians over color. Unfortunately, this model performs ...
Gerald Dalley, Joshua Migdal, W. Eric L. Grimson