Sciweavers

5580 search results - page 702 / 1116
» Randomized priority algorithms
Sort
View
ECOOP
2007
Springer
15 years 8 months ago
Efficiently Generating Structurally Complex Inputs with Thousands of Objects
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
Bassem Elkarablieh, Yehia Zayour, Sarfraz Khurshid
PODC
2010
ACM
15 years 8 months ago
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
James Aspnes
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 7 months ago
Strong recombination, weak selection, and mutation
We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the...
Alden H. Wright, J. Neal Richter
EDBT
2010
ACM
135views Database» more  EDBT 2010»
15 years 7 months ago
Probabilistic ranking over relations
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin
AAAI
2007
15 years 6 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...