Sciweavers

7228 search results - page 119 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
105
Voted
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
15 years 7 months ago
The dispersion metric and the CMA evolution strategy
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
Monte Lunacek, Darrell Whitley
SIGSOFT
2008
ACM
16 years 4 months ago
Randomized active atomicity violation detection in concurrent programs
Atomicity is an important specification that enables programmers to understand atomic blocks of code in a multi-threaded program as if they are sequential. This significantly simp...
Chang-Seo Park, Koushik Sen
155
Voted
ISSTA
2012
ACM
13 years 5 months ago
Swarm testing
Swarm testing is a novel and inexpensive way to improve the diversity of test cases generated during random testing. Increased diversity leads to improved coverage and fault detec...
Alex Groce, Chaoqiang Zhang, Eric Eide, Yang Chen,...
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
16 years 4 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
CIKM
2005
Springer
15 years 9 months ago
Query expansion using random walk models
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
Kevyn Collins-Thompson, Jamie Callan