1541 search results - page 195 / 309 » Analysis of Random Noise and Random Walk Algorithms |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
BIRTHDAY
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
WABI
2005
Springer
14 years 1 months ago
2005
Springer
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...