Sciweavers

1220 search results - page 57 / 244
» Minimal Interval Completions
Sort
View
AOR
2006
77views more  AOR 2006»
13 years 9 months ago
Preemptive Scheduling with Position Costs
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a function of its completion time. Instead, the cost is derived from the integratio...
Francis Sourd
SAC
2006
ACM
14 years 3 months ago
Adaptive page-level incremental checkpointing based on expected recovery time
Incremental checkpointing, which is intended to minimize checkpointing overhead, saves only the modified pages of a process. This means that in incremental checkpointing, the time...
Sangho Yi, Junyoung Heo, Yookun Cho, Jiman Hong
ICC
2007
IEEE
101views Communications» more  ICC 2007»
14 years 3 months ago
On the Limitations of Random Sensor Placement for Distributed Signal Detection
— We consider the design of a sensor network for detecting an emitter who if present is known to be located in an interval but whose exact position is unknown. We seek to minimiz...
Zhenyu Tu, Rick S. Blum
AUTOMATICA
2007
84views more  AUTOMATICA 2007»
13 years 9 months ago
Nonsmooth optimization for multiband frequency domain control design
Multiband frequency domain synthesis consists in the minimization of a finite family of closed-loop transfer functions on prescribed frequency intervals. This is an algorithmical...
Pierre Apkarian, Dominikus Noll
CORR
2008
Springer
58views Education» more  CORR 2008»
13 years 9 months ago
Tight Bounds on Minimum Maximum Pointwise Redundancy
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
Michael Baer