Sciweavers

1941 search results - page 89 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
SAPIR
2004
Springer
15 years 11 months ago
Probabilistic Routing in Intermittently Connected Networks
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at...
Anders Lindgren, Avri Doria, Olov Schelén
AI
2007
Springer
16 years 10 days ago
Planning in Multiagent Expedition with Collaborative Design Networks
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
Yang Xiang, Franklin Hanshar
GLOBECOM
2007
IEEE
16 years 14 days ago
Process for QoS-Aware IP Network Planning Using Accounting Data and Effective Bandwidth Estimation
- In this paper we describe QoSPlan – a generalized process for preparing information relevant to QoS-aware IP network planning. QoSPlan is designed to reduce the cost of deploym...
Alan Davy, Dmitri Botvich, Brendan Jennings
ALGOSENSORS
2009
Springer
16 years 23 days ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
BMCBI
2011
14 years 9 months ago
MINE: Module Identification in NEtworks
Background: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of function...
Kahn Rhrissorrakrai, Kristin C. Gunsalus