Sciweavers

3047 search results - page 111 / 610
» Randomized Parallel Selection
Sort
View
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
14 years 4 months ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld
STACS
2012
Springer
12 years 5 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
JSAT
2008
85views more  JSAT 2008»
13 years 10 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
ICDM
2005
IEEE
187views Data Mining» more  ICDM 2005»
14 years 3 months ago
Parallel Algorithms for Distance-Based and Density-Based Outliers
An outlier is an observation that deviates so much from other observations as to arouse suspicion that it was generated by a different mechanism. Outlier detection has many applic...
Elio Lozano, Edgar Acuña
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 11 months ago
Randomized Synopses for Query Assurance on Data Streams
The overwhelming flow of information in many data stream applications forces many companies to outsource to a third-party the deployment of a Data Stream Management System (DSMS) f...
Ke Yi, Feifei Li, Marios Hadjieleftheriou, George ...