Sciweavers

3991 search results - page 104 / 799
» Bounding homogeneous models
Sort
View
CP
2005
Springer
15 years 10 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
ICALP
2005
Springer
15 years 10 months ago
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
Martin Grohe, Christoph Koch, Nicole Schweikardt
INFOCOM
1993
IEEE
15 years 9 months ago
Burstiness Bounds for Some Burst Reducing Servers
In [18], we propose a framework to study a stream of trafic or message as it is transferred over an ATM connection. A message is modeled as a deierministic fluid flow, and an ATM ...
Steven H. Low, Pravin Varaiya
COR
2008
175views more  COR 2008»
15 years 5 months ago
Lower and upper bounds for a two-level hierarchical location problem in computer networks
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
Aníbal Alberto Vilcapoma Ignacio, Virg&iacu...
MONET
2011
14 years 12 months ago
Mathematical Analysis of Throughput Bounds in Random Access with ZigZag Decoding
— We investigate the throughput improvement that ZIGZAG decoding (Gollakota and Katabi (2008)) can achieve in multi-user random access systems. ZIGZAG is a recently proposed 802....
Jeongyeup Paek, Michael J. Neely