Sciweavers

474 search results - page 33 / 95
» On Multicast Path Finding Algorithms
Sort
View
TCS
2008
13 years 7 months ago
Paths and trails in edge-colored graphs
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
A. Abouelaoualim, Kinkar Chandra Das, L. Faria, Ya...
ICST
2009
IEEE
14 years 2 months ago
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM)
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...
Abdul Salam Kalaji, Robert M. Hierons, Stephen Swi...
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
14 years 29 days ago
On-line safe path planning in unknown environments
s - For the on-line safe path planning of a mobile robot in unknown environments, the paper proposes a simple Hopfield Neural Network ( HNN ) planner. Without learning process, the...
Weidong Chen, Changhong Fan, Yugeng Xi
ICC
2007
IEEE
183views Communications» more  ICC 2007»
14 years 2 months ago
Most Reliable Routing in WDM Mesh Networks with Arbitrary Risk Distribution
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
Ji Li, Kwan Lawrence Yeung
JNW
2008
124views more  JNW 2008»
13 years 7 months ago
A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...
Shahab Kamali, Jaroslav Opatrny