Sciweavers

707 search results - page 52 / 142
» Solving path problems on the GPU
Sort
View
MICCAI
2002
Springer
16 years 2 months ago
Regularized Stochastic White Matter Tractography Using Diffusion Tensor MRI
The development of Diffusion Tensor MRI has raised hopes in the neuro-science community for in vivo methods to track fiber paths in the white matter. A number of approaches have be...
Mats Björnemo, Anders Brun, Ron Kikinis, Carl...
TAPIA
2003
ACM
15 years 6 months ago
A new infeasible interior-point algorithm for linear programming
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
Miguel Argáez, Leticia Velázquez
AI
2006
Springer
15 years 1 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
BROADNETS
2007
IEEE
15 years 7 months ago
Dedicated path protection for waveband switching in WDM networks (invited paper)
— This paper considers the problem of dedicated path-protection in a wavelength-division multiplexing (WDM) mesh network with waveband switching (WBS) functionality under shared ...
Mengke Li, Byrav Ramamurthy
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 9 days ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...