Sciweavers

207 search results - page 20 / 42
» Run-Time Switching Between Total Order Algorithms
Sort
View
ASPDAC
2006
ACM
110views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Switching-activity driven gate sizing and Vth assignment for low power design
Power consumption has gained much saliency in circuit design recently. One design problem is modelled as ”Under a timing constraint, to minimize power as much as possible”. Pr...
Yu-Hui Huang, Po-Yuan Chen, TingTing Hwang
ICML
2006
IEEE
14 years 8 months ago
Feature value acquisition in testing: a sequential batch test algorithm
In medical diagnosis, doctors often have to order sets of medical tests in sequence in order to make an accurate diagnosis of patient diseases. While doing so they have to make a ...
Victor S. Sheng, Charles X. Ling
APWEB
2005
Springer
14 years 29 days ago
A Fast Algorithm for Mining Share-Frequent Itemsets
Itemset share has been proposed as a measure of the importance of itemsets for mining association rules. The value of the itemset share can provide useful information such as total...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 7 months ago
Online Algorithms for the Multi-Armed Bandit Problem with Markovian Rewards
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
Cem Tekin, Mingyan Liu
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
13 years 11 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noisy BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ) and (1 + 2) Evolution-Strategies (ESs) with the aim of designing f...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen