Sciweavers

9325 search results - page 212 / 1865
» The decentralized implementability problem
Sort
View
125
Voted
JSW
2006
76views more  JSW 2006»
15 years 3 months ago
Variable Neighbourhood Search for Job Shop Scheduling Problems
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...
Mehmet Sevkli, Mehmet Emin Aydin
ICIP
2010
IEEE
15 years 19 days ago
Polyconvexification of the multi-label optical flow problem
In this paper the problem of optical flow and occlusion mask estimation is aborded. To that end, we consider a multi-label representation of the optical flow and we define an ener...
Nicolas Papadakis, Antonio Baeza, Pau Gargallo, Vi...
115
Voted
ESA
2004
Springer
117views Algorithms» more  ESA 2004»
15 years 8 months ago
Classroom Examples of Robustness Problems in Geometric Computations
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan ...
IJCGA
2008
114views more  IJCGA 2008»
15 years 3 months ago
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
Magdalene G. Borgelt, Christian Borgelt, Christos ...
SIAMJO
2002
77views more  SIAMJO 2002»
15 years 2 months ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright