Sciweavers

3934 search results - page 141 / 787
» Approximate Schedulability Analysis
Sort
View
IAAI
2003
15 years 7 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
QEST
2006
IEEE
16 years 12 days ago
Modeling and Optimization Problems in Contact Centers
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...
Pierre L'Ecuyer
TPDS
2008
68views more  TPDS 2008»
15 years 6 months ago
Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
Teofilo F. Gonzalez
INFOCOM
2012
IEEE
13 years 8 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
DATE
2009
IEEE
139views Hardware» more  DATE 2009»
16 years 1 months ago
Reliable mode changes in real-time systems with fixed priority or EDF scheduling
Abstract—Many application domains require adaptive realtime embedded systems that can change their functionality over time. In such systems it is not only necessary to guarantee ...
Nikolay Stoimenov, Simon Perathoner, Lothar Thiele