453 search results - page 26 / 91 » Tight bounds for the partial-sums problem |
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
SIROCCO
2004
13 years 9 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
WDAG
2007
Springer
14 years 2 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device with several input po...
RC
2007
13 years 8 months ago
2007
This paper develops easily computed, tight bounds on Generalized Linear Predictors and instrumental variable estimators when outcome data are partially identi…ed. A salient exam...