Sciweavers

158 search results - page 28 / 32
» The Cover Time, the Blanket Time, and the Matthews Bound
Sort
View
POPL
2009
ACM
14 years 9 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
INFOCOM
2005
IEEE
14 years 2 months ago
Optimal utility based multi-user throughput allocation subject to throughput constraints
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
Matthew Andrews, Lijun Qian, Alexander L. Stolyar
GI
2009
Springer
13 years 6 months ago
Combined Optimization of Aircraft Maneuvers and RF Measurements for Passive Air-Air Ranging
: When a tactical aircraft sets out on a mission in dense airborne and surface RF (radio frequency) emitter environment, the pilot desires to minimize the use of the onboard fire c...
Ronald Matthew Yannone, Melvin Carroll
FOCS
2002
IEEE
14 years 1 months ago
Low-Dimensional Linear Programming with Violations
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
Timothy M. Chan
SIGSOFT
2003
ACM
14 years 9 months ago
Deadline analysis of interrupt-driven software
Real-time, reactive, and embedded systems are increasingly used throughout society (e.g., flight control, railway signaling, vehicle management, medical devices, and many others)....
Dennis Brylow, Jens Palsberg