279 search results - page 23 / 56 » Reduction approaches for robust shortest path problems |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
ICPP
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
EOR
2010
14 years 4 months ago
2010
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
100
click to vote
PR
2006
14 years 9 months ago
2006
In the past few years, some nonlinear dimensionality reduction (NLDR) or nonlinear manifold learning methods have aroused a great deal of interest in the machine learning communit...
SCN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...