Sciweavers

660 search results - page 88 / 132
» Hybrid CSP Solving
Sort
View
ESANN
2008
15 years 5 months ago
On related violating pairs for working set selection in SMO algorithms
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
Tobias Glasmachers
120
Voted
SIMVIS
2000
15 years 4 months ago
Vector Field Visualization on the Internet
We discuss the problems to be solved to develop a web-based vector field visualization system. Furthermore we present the system CurVis as one solution of these problems. As part ...
Uwe Rauschenbach, Holger Theisel, C. Perez Risquet...
109
Voted
AUTOMATICA
2006
91views more  AUTOMATICA 2006»
15 years 3 months ago
Necessary and sufficient conditions for reachability on a simplex
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
Bartek Roszak, Mireille E. Broucke
123
Voted
EOR
2007
174views more  EOR 2007»
15 years 3 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
143
Voted
JMIV
2007
136views more  JMIV 2007»
15 years 3 months ago
Image Compression Through a Projection onto a Polyhedral Set
In image denoising, many researchers have tried for several years to combine wavelet-like approaches and optimization methods (typically based on the total variation minimization)...
François Malgouyres