Sciweavers

4345 search results - page 778 / 869
» Temporal Constraint Networks
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 1 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
CONEXT
2005
ACM
13 years 9 months ago
Location based placement of whole distributed systems
The high bandwidth and low latency of the modern internet has made possible the deployment of distributed computing platforms. The XenoServer platform provides a distributed compu...
David Spence, Jon Crowcroft, Steven Hand, Timothy ...
BMCBI
2006
133views more  BMCBI 2006»
13 years 7 months ago
Choosing negative examples for the prediction of protein-protein interactions
The protein-protein interaction networks of even well-studied model organisms are sketchy at best, highlighting the continued need for computational methods to help direct experim...
Asa Ben-Hur, William Stafford Noble
COMCOM
2006
103views more  COMCOM 2006»
13 years 7 months ago
Research challenges in QoS routing
Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities ...
Xavier Masip-Bruin, Marcelo Yannuzzi, Jordi Doming...
JSAC
2007
180views more  JSAC 2007»
13 years 7 months ago
A Cross-Layer Approach for WLAN Voice Capacity Planning
— This paper presents an analytical approach to determining the maximum number of on/off voice flows that can be supported over a wireless local area network (WLAN), under a qua...
Yu Cheng, Xinhua Ling, Wei Song, Lin X. Cai, Weihu...