Sciweavers

1185 search results - page 90 / 237
» The Equivalence of Sampling and Searching
Sort
View
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 8 months ago
Mining coherent gene clusters from gene-sample-time microarray data
Extensive studies have shown that mining microarray data sets is important in bioinformatics research and biomedical applications. In this paper, we explore a novel type of genesa...
Daxin Jiang, Jian Pei, Murali Ramanathan, Chun Tan...
GECCO
2010
Springer
194views Optimization» more  GECCO 2010»
13 years 12 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
DAC
2001
ACM
14 years 8 months ago
Circuit-based Boolean Reasoning
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
Andreas Kuehlmann, Malay K. Ganai, Viresh Paruthi
ICFP
2007
ACM
14 years 7 months ago
Inductive reasoning about effectful data types
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...
Andrzej Filinski, Kristian Støvring
SIGECOM
2009
ACM
92views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
The adwords problem: online keyword matching with budgeted bidders under random permutations
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
Nikhil R. Devenur, Thomas P. Hayes