Sciweavers

707 search results - page 55 / 142
» Solving path problems on the GPU
Sort
View
DNA
2007
Springer
107views Bioinformatics» more  DNA 2007»
15 years 6 months ago
Solutions to Computational Problems Through Gene Assembly
Abstract. Gene assembly in ciliates is an impressive computational process. Ciliates have a unique way of storing their genetic information in two fundamentally different forms wi...
Artiom Alhazov, Ion Petre, Vladimir Rogojin
IJCAI
2007
15 years 1 months ago
Handling Alternative Activities in Resource-Constrained Project Scheduling Problems
In the context of operative disruption management, decision support systems have to evaluate the typically manifold options of responding to disturbances: The temporal shift of ac...
Jürgen Kuster, Dietmar Jannach, Gerhard Fried...
SIAMJO
2008
82views more  SIAMJO 2008»
14 years 11 months ago
Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
A first order affine scaling method and two mth order affine scaling methods for solving monotone linear complementarity problems (LCP) are presented. All three methods produce ite...
Florian A. Potra
AIPS
2006
15 years 1 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley
ECCV
2010
Springer
14 years 9 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...