Sciweavers

149 search results - page 26 / 30
» On Finding Minimum Deadly Sets for Directed Networks
Sort
View
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 2 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
MASCOTS
2004
13 years 8 months ago
An Optimisation Model for a Two-Node Router Network
Architectural designs for routers and networks of routers to support mobile communication are analysed for their end-to-end performance using a simple Markov model. In view of the...
Nalan Gülpinar, Peter G. Harrison, Berç...
BMCBI
2007
165views more  BMCBI 2007»
13 years 7 months ago
Automatic reconstruction of a bacterial regulatory network using Natural Language Processing
Background: Manual curation of biological databases, an expensive and labor-intensive process, is essential for high quality integrated data. In this paper we report the implement...
Carlos Rodríguez Penagos, Heladia Salgado, ...
INFOCOM
2005
IEEE
14 years 1 months ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann
ORL
2006
105views more  ORL 2006»
13 years 7 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...