7228 search results - page 165 / 1446 » From Algorithmic to Subjective Randomness |
141
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
145
Voted
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
113
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Addressing dynamic optimization problems has been a challenging task for the genetic algorithm community. Over the years, several approaches have been developed into gene...
153
Voted
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
125
Voted
PAKDD
2007
ACM
15 years 9 months ago
2007
ACM
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...