Sciweavers

39 search results - page 2 / 8
» Improved Algorithms for Max-restricted Path Consistency
Sort
View
NETWORKS
2008
13 years 4 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
ICASSP
2011
IEEE
12 years 8 months ago
A proportionate adaptive algorithm with variable partitioned block length for acoustic echo cancellation
Due to the nature of an acoustic enclosure, the early part (i.e., direct path and early reflections) of the acoustic echo path is often sparse while the late reverberant part of ...
Pradeep Loganathan, Emanuel A. P. Habets, Patrick ...
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 6 months ago
Exploiting the path of least resistance in evolution
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
Gearoid Murphy, Conor Ryan
DCG
2010
289views more  DCG 2010»
13 years 5 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
13 years 9 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...