Sciweavers

9871 search results - page 71 / 1975
» On the Structure of Low Sets
Sort
View
JORS
2010
87views more  JORS 2010»
13 years 7 months ago
The challenge of optimizing expensive black boxes: a scatter search/rough set theory approach
  There is renewed interest in the development of effective and efficient methods for optimizing models  of  which  the  optimizer  has  no  structural  know...
Manuel Laguna, Julián Molina Luque, Fatima ...
EVOW
2005
Springer
14 years 2 months ago
Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework
A hyperheuristic is a high level procedure which searches over a space of low level heuristics rather than directly over the space of problem solutions. The sequence of low level h...
Konstantin Chakhlevitch, Peter I. Cowling
ICIAP
2003
ACM
14 years 2 months ago
PCA vs low resolution images in face verification
Principal Components Analysis (PCA) has been one of the most applied methods for face verification using only 2D information, in fact, PCA is practically the method of choice for ...
Cristina Conde, Antonio Ruiz, Enrique Cabello
TSP
2008
99views more  TSP 2008»
13 years 9 months ago
Filter Design With Low Complexity Coefficients
We introduce a heuristic for designing filters that have low complexity coefficients, as measured by the total number of nonzeros digits in the binary or canonic signed digit (CSD)...
Joelle Skaf, Stephen P. Boyd
ANOR
2008
89views more  ANOR 2008»
13 years 9 months ago
Ordered sets with interval representation and ( m , n )-Ferrers relation
: Semiorders may form the simplest class of ordered sets with a not necessarily transitive indifference relation. Their generalization has given birth to many other classes of orde...
Meltem Öztürk