Sciweavers

3499 search results - page 395 / 700
» On the local optimality of LambdaRank
Sort
View
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
16 years 27 days ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles
ISVC
2007
Springer
16 years 26 days ago
Image Compression Using Data-Dependent Triangulations
We present a method to speed up the computation of a high-quality data-dependent triangulation approximating an image using simulated annealing by probability distributions guided ...
Burkhard Lehner, Georg Umlauf, Bernd Hamann
LION
2007
Springer
138views Optimization» more  LION 2007»
16 years 26 days ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
ICRA
2006
IEEE
119views Robotics» more  ICRA 2006»
16 years 23 days ago
Polygonal Approximation of Laser Range Data based on Perceptual Grouping and EM
— Our goal is polygonal approximation of laser range data points obtained by a mobile robot. The proposed approach provides a precise estimation of the number of model components...
Longin Jan Latecki, Rolf Lakämper
ICCV
2005
IEEE
16 years 10 days ago
How Hard is 3-View Triangulation Really?
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
Henrik Stewénius, Frederik Schaffalitzky, D...