5138 search results - page 124 / 1028 » Randomized Algorithms for 3-SAT |
106
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
124
click to vote
AOSD
2007
ACM
15 years 6 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
110
Voted
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
113
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
102
click to vote
KDD
2003
ACM
16 years 2 months ago
2003
ACM
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...