Sciweavers

505 search results - page 87 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
LAWEB
2006
IEEE
15 years 7 months ago
OWeB: A Framework for Offline Web Browsing
Internet browsing is highly dependent on the real-time network availability and speed. This becomes a significant constraint when browsing over slow and intermittent networks. In ...
Ganesh Ananthanarayanan, Sean Olin Blagsvedt, Kent...
BMCBI
2008
152views more  BMCBI 2008»
15 years 1 months ago
Predicting biological system objectives de novo from internal state measurements
Background: Optimization theory has been applied to complex biological systems to interrogate network properties and develop and refine metabolic engineering strategies. For examp...
Erwin P. Gianchandani, Matthew A. Oberhardt, Antho...
INFOCOM
2010
IEEE
14 years 12 months ago
A Systematic Approach for Evolving VLAN Designs
—Enterprise networks are large and complex, and their designs must be frequently altered to adapt to changing organizational needs. The process of redesigning and reconfiguring ...
Xin Sun, Yu-Wei Eric Sung, Sunil Krothapalli, Sanj...
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 6 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
TMC
2010
138views more  TMC 2010»
14 years 11 months ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li