Sciweavers

336 search results - page 31 / 68
» Approximating Transitivity in Directed Networks
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 4 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
IFIP
2009
Springer
14 years 5 months ago
A Calculus of Trustworthy Ad Hoc Networks
We propose a process calculus for mobile ad hoc networks which embodies a behaviour-based multilevel decentralised trust model. Our trust model supports both direct trust, by monit...
Massimo Merro, Eleonora Sibilio
ORL
2006
105views more  ORL 2006»
13 years 10 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...
SIGCOMM
1997
ACM
14 years 3 months ago
End-to-end Internet Packet Dynamics
We discuss findings from a large-scale study of Internet packet dynamics conducted by tracing 20,000 TCP bulk transfers between 35 Internet sites. Because we traced each 100 Kbyt...
Vern Paxson
ECAI
2006
Springer
14 years 2 months ago
Improving Bound Propagation
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...
Bozhena Bidyuk, Rina Dechter