Sciweavers

653 search results - page 9 / 131
» Using common random numbers for indifference-zone selection
Sort
View
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 8 months ago
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
VTC
2008
IEEE
179views Communications» more  VTC 2008»
14 years 1 months ago
Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission
This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source-destination pair. Opt...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
JGAA
2007
135views more  JGAA 2007»
13 years 7 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
ICCV
2007
IEEE
14 years 9 months ago
Image Classification using Random Forests and Ferns
We explore the problem of classifying images by the object categories they contain in the case of a large number of object categories. To this end we combine three ingredients: (i...
Andrew Zisserman, Anna Bosch, Xavier Muñoz
ISNN
2005
Springer
14 years 1 months ago
Multiple Parameter Selection for LS-SVM Using Smooth Leave-One-Out Error
In least squares support vector (LS-SVM), the key challenge lies in the selection of free parameters such as kernel parameters and tradeoff parameter. However, when a large number ...
Liefeng Bo, Ling Wang, Licheng Jiao