Sciweavers

1815 search results - page 42 / 363
» Path Planning for Network Performance
Sort
View
IPPS
1998
IEEE
15 years 2 months ago
A Parallel Algorithm for Minimum Cost Path Computation on Polymorphic Processor Array
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
Pierpaolo Baglietto, Massimo Maresca, Mauro Miglia...
INFOCOM
2009
IEEE
15 years 4 months ago
Path Diversity Aware Interdomain Routing
—As the Internet becomes the critical information infrastructure for both personal and business applications, fast and reliable routing protocols need to be designed to maintain ...
Feng Wang, Lixin Gao
GLOBECOM
2008
IEEE
15 years 4 months ago
Performance Comparison between NEMO BSP and SINEMO
Abstract—IETF has proposed Mobile IPv6-based Network Mobility (NEMO) basic support protocol (BSP) to support network mobility. NEMO BSP inherits all the drawbacks of Mobile IPv6,...
Md. Sazzadur Rahman, Outman Bouidel, Mohammed Atiq...
ICRA
2010
IEEE
111views Robotics» more  ICRA 2010»
14 years 8 months ago
Control and planning for vehicles with uncertainty in dynamics
— This paper describes a motion planning algorithm that accounts for uncertainty in the dynamics of vehicles. This noise is a function of the type of controller employed on the v...
Daniel Mellinger, Vijay Kumar
JUCS
2007
112views more  JUCS 2007»
14 years 9 months ago
Internet Path Behavior Prediction via Data Mining: Conceptual Framework and Case Study
: In this paper we propose an application of data mining methods in the prediction of the availability and performance of Internet paths. We deploy a general decision-making method...
Leszek Borzemski