Sciweavers

1815 search results - page 56 / 363
» Path Planning for Network Performance
Sort
View
MOBIQUITOUS
2007
IEEE
15 years 4 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
ICRA
2009
IEEE
152views Robotics» more  ICRA 2009»
15 years 4 months ago
Reachability-guided sampling for planning under differential constraints
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
Alexander C. Shkolnik, Matthew Walter, Russ Tedrak...
TC
2010
14 years 4 months ago
Model-Driven System Capacity Planning under Workload Burstiness
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
ICDCS
2002
IEEE
15 years 2 months ago
Query Optimization to Meet Performance Targets for Wide Area Applications
Recent technology advances have enabled mediated query processing with Internet accessible WebSources. A characteristic of WebSources is that their access costs exhibit transient ...
Vladimir Zadorozhny, Louiqa Raschid
BERTINORO
2005
Springer
15 years 3 months ago
Self-Management of Virtual Paths in Dynamic Networks
Abstract Virtual path management in dynamic networks poses a number of challenges related to combinatorial optimisation, fault and traffic handling. Ideally such management should ...
Poul E. Heegaard, Otto Wittner, Bjarne E. Helvik