5138 search results - page 514 / 1028 » Randomized Algorithms for 3-SAT |
189
click to vote
EUC
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose a hierarchical architecture for grouping peers into clusters in a large-scale BitTorrent-like underlying overlay network in such a way that clusters are e...
196
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a gregarious particle swarm optimization algorithm (G-PSO) in which the particles explore the search space by aggressively scouting the local minima with the h...
180
click to vote
EUROPAR
2000
Springer
15 years 10 months ago
2000
Springer
The aim of this paper is to study the influence of processor mapping on message passing performance of two different parallel computers: the Cray T3E and the SGI Origin 2000. For t...
167
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
173
click to vote
COLING
2008
15 years 8 months ago
2008
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...