3359 search results - page 161 / 672 » A Simplified Idea Algorithm |
125
click to vote
AI
2005
Springer
15 years 4 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
181
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
175
click to vote
SIGMOD
1993
ACM
15 years 8 months ago
1993
ACM
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
152
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
129
click to vote
STOC
1997
ACM
15 years 8 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...