Sciweavers

13 search results - page 2 / 3
» Long Local Searches for Maximal Bipartite Subgraphs
Sort
View
GECCO
2006
Springer
174views Optimization» more  GECCO 2006»
13 years 8 months ago
On the analysis of the (1+1) memetic algorithm
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
Dirk Sudholt
WWW
2003
ACM
14 years 5 months ago
A new paradigm for ranking pages on the world wide web
This paper describes a new paradigm for modeling traffic levels on the world wide web (WWW) using a method of entropy maximization. This traffic is subject to the conservation con...
John A. Tomlin
BMCBI
2008
106views more  BMCBI 2008»
13 years 4 months ago
Searching for evolutionary distant RNA homologs within genomic sequences using partition function posterior probabilities
Background: Identification of RNA homologs within genomic stretches is difficult when pairwise sequence identity is low or unalignable flanking residues are present. In both cases...
Usman Roshan, Satish Chikkagoudar, Dennis R. Lives...
VLDB
2002
ACM
154views Database» more  VLDB 2002»
13 years 4 months ago
I/O-Conscious Data Preparation for Large-Scale Web Search Engines
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
Maxim Lifantsev, Tzi-cker Chiueh
ICML
2009
IEEE
14 years 5 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...