Sciweavers

72 search results - page 12 / 15
» Random search can outperform mutation
Sort
View
SIGIR
2009
ACM
15 years 4 months ago
Global ranking by exploiting user clicks
It is now widely recognized that user interactions with search results can provide substantial relevance information on the documents displayed in the search results. In this pape...
Shihao Ji, Ke Zhou, Ciya Liao, Zhaohui Zheng, Gui-...
72
Voted
BMCBI
2010
169views more  BMCBI 2010»
14 years 9 months ago
eCOMPAGT integrates mtDNA: import, validation and export of mitochondrial DNA profiles for population genetics, tumour dynamics
Background: Mitochondrial DNA (mtDNA) is widely being used for population genetics, forensic DNA fingerprinting and clinical disease association studies. The recent past has uncov...
Hansi Weißensteiner, Sebastian Schönher...
80
Voted
WWW
2006
ACM
15 years 10 months ago
Beyond PageRank: machine learning for static ranking
Since the publication of Brin and Page's paper on PageRank, many in the Web community have depended on PageRank for the static (query-independent) ordering of Web pages. We s...
Matthew Richardson, Amit Prakash, Eric Brill
WSC
2004
14 years 11 months ago
Stochastic Approximation with Simulated Annealing as an Approach to Global Discrete-Event Simulation Optimization
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
Matthew H. Jones, K. Preston White
ICGI
2010
Springer
14 years 7 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer