2814 search results - page 314 / 563 » Competitive Analysis of Distributed Algorithms |
129
click to vote
IPL
2011
14 years 5 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
130
click to vote
COR
2010
15 years 2 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
188
click to vote
SIGMOD
1999
ACM
15 years 6 months ago
1999
ACM
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
137
click to vote
PPSN
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
149
click to vote
HIPC
2009
Springer
15 years 38 min ago
2009
Springer
As the size of available datasets in various domains is growing rapidly, there is an increasing need for scaling data mining implementations. Coupled with the current trends in co...