Sciweavers

1529 search results - page 119 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
IOR
2006
177views more  IOR 2006»
15 years 4 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
EDBT
2011
ACM
225views Database» more  EDBT 2011»
14 years 7 months ago
On (not) indexing quadratic form distance by metric access methods
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
Tomás Skopal, Tomás Bartos, Jakub Lo...
119
Voted
IBPRIA
2005
Springer
15 years 9 months ago
Fast Surface Grading Using Color Statistics in the CIE Lab Space
In this paper we approach the problem of fast surface grading of flat pieces decorated with random patterns. The proposed method is based on the use of global statistics of color ...
Fernando López, José Miguel Valiente...
TEC
2010
203views more  TEC 2010»
14 years 11 months ago
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These nic...
Xiaodong Li
JDCTA
2010
272views more  JDCTA 2010»
14 years 11 months ago
Optimal Control of Nonlinear Systems Using the Homotopy Perturbation Method: Infinite Horizon Case
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
Amin Jajarmi, Hamidreza Ramezanpour, Arman Sargolz...