Using this method proposed here, both executing and candidate paths are generated for the application,the expectation path within candidate paths is found,and then the assumed fault is located by comparing the executing path with the candidate path.

The original LDM algorithm tries to find a set of candidate paths and selects a path with the highest probability from the candidate path set to assign a flow.

Using this method proposed here, we generate both executing and candidate paths for the application, finding the expectation path within candidate paths, and then to locate the assumed fault by comparing the executing path with the candidate path.

Based on the D-PWS,an entire-candidate path sets(E-CPS) wavelength assignment algorithm is given to control losing rate of all kinds of priority services in DWR-OBS network.

Then we describe a genetic algorithm based on the Candidate-Route Library to solve it.

Views on reforms to China s exchange rate arrangements: force, restraint and route selection;

Route Selection for Constructing the Harmonious Trade Unions;

Exploring Drivers Route Choice Response to Real-time Guidance Information of Variable Message Signs;

Application of fluid neuron network on route choice based on user optimum in traffic network;

Simulation-based approach to evaluate dynamic multiple user route choice behavior under ATIS;