Sciweavers

478 search results - page 63 / 96
» Improving probability bounds by optimization over subsets
Sort
View
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
14 years 1 months ago
Mutation Rates in the Context of Hybrid Genetic Algorithms
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
Seung-Hee Bae, Byung Ro Moon
ICMCS
2005
IEEE
119views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Evaluation of the Interleaved Source Coding (ISC) Under Packet Correlation
Network impairments such as delay and packet losses have severe impact on the presentation quality of many predictive video sources. Prior researches (e.g., [1]-[3][5]-[9][11]-[13...
Jin Young Lee, Hayder Radha
ECRTS
2008
IEEE
14 years 2 months ago
Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors
Scheduling of sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal sch...
Insik Shin, Arvind Easwaran, Insup Lee
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolutionary selection of minimum number of features for classification of gene expression data using genetic algorithms
Selecting the most relevant factors from genetic profiles that can optimally characterize cellular states is of crucial importance in identifying complex disease genes and biomark...
Alper Küçükural, Reyyan Yeniterzi...
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 7 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos