Sciweavers

1815 search results - page 127 / 363
» Path Planning for Network Performance
Sort
View
SIGCOMM
2004
ACM
14 years 1 months ago
Routing in a delay tolerant network
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
Sushant Jain, Kevin R. Fall, Rabin K. Patra
ICDCS
2009
IEEE
13 years 6 months ago
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang
JPDC
2006
187views more  JPDC 2006»
13 years 8 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
AIPS
2000
13 years 9 months ago
Merging Plans with Quantitative Temporal Constraints, Temporally Extended Actions, and Conditional Branches
We develop an algorithm for merging plans that are represented in a richly expressive language. Speci cally, weare concerned with plans that have i quantitative temporal constrain...
Ioannis Tsamardinos, Martha E. Pollack, John F. Ho...
SEMWEB
2004
Springer
14 years 1 months ago
Information Gathering During Planning for Web Service Composition
Abstract. Hierarchical Task-Network (HTN) based planning techniques have been applied to the problem of composing Web Services, especially when described using the OWL-S service on...
Ugur Kuter, Evren Sirin, Dana S. Nau, Bijan Parsia...