Sciweavers

1603 search results - page 87 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
ICAL
2011
301views more  ICAL 2011»
14 years 6 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...
EVOW
2004
Springer
15 years 11 months ago
Solving a Real-World Glass Cutting Problem
We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, ...
Jakob Puchinger, Günther R. Raidl, Gabriele K...
PROCEDIA
2011
14 years 9 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
CVPR
2011
IEEE
14 years 10 months ago
A Novel Parametrization of the Perspective-Three-Point Problem for a Direct Computation of Absolute Camera Position and Orientat
The Perspective-Three-Point (P3P) problem aims at determining the position and orientation of the camera in the world reference frame from three 2D-3D point correspondences. This ...
Laurent Kneip, Davide Scaramuzza, Roland Siegwart
ECRTS
2010
IEEE
15 years 7 months ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...