Sciweavers

7228 search results - page 70 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ASPLOS
2010
ACM
15 years 4 months ago
A randomized scheduler with probabilistic guarantees of finding bugs
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
Sebastian Burckhardt, Pravesh Kothari, Madanlal Mu...
GECCO
2009
Springer
162views Optimization» more  GECCO 2009»
15 years 2 months ago
TestFul: using a hybrid evolutionary algorithm for testing stateful systems
This paper introduces TestFul, a framework for testing stateful systems and focuses on object-oriented software. TestFul employs a hybrid multi-objective evolutionary algorithm, t...
Matteo Miraz, Pier Luca Lanzi, Luciano Baresi
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 3 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
CORR
2010
Springer
320views Education» more  CORR 2010»
14 years 10 months ago
An algorithm for the principal component analysis of large data sets
Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy -- even on parallel processors -- unlike the...
Nathan Halko, Per-Gunnar Martinsson, Yoel Shkolnis...
IJCNN
2007
IEEE
15 years 4 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar