Sciweavers

1594 search results - page 24 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
ICCSA
2004
Springer
15 years 5 months ago
New Parameter for Balancing Two Independent Measures in Routing Path
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
AAIM
2009
Springer
119views Algorithms» more  AAIM 2009»
15 years 6 months ago
Link Distance and Shortest Path Problems in the Plane
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
Atlas F. Cook, Carola Wenk
CORR
2011
Springer
163views Education» more  CORR 2011»
14 years 3 months ago
Suboptimal Solution Path Algorithm for Support Vector Machine
We consider a suboptimal solution path algorithm for the Support Vector Machine. The solution path algorithm is an effective tool for solving a sequence of a parametrized optimiz...
Masayuki Karasuyama, Ichiro Takeuchi
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
14 years 10 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
NETWORKS
2008
14 years 11 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