Sciweavers

1456 search results - page 125 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
ICDCS
1999
IEEE
15 years 3 months ago
Interpreting Stale Load Information
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...
Michael Dahlin
BMCBI
2008
113views more  BMCBI 2008»
14 years 11 months ago
Investigating selection on viruses: a statistical alignment approach
Background: Two problems complicate the study of selection in viral genomes: Firstly, the presence of genes in overlapping reading frames implies that selection in one reading fra...
Saskia de Groot, Thomas Mailund, Gerton Lunter, Jo...
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
15 years 11 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
COLT
2007
Springer
15 years 5 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
15 years 4 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon