8728 search results - page 426 / 1746 » On Reduct Construction Algorithms |
212
click to vote
AAMAS
2011
Springer
15 years 1 months ago
2011
Springer
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
154
click to vote
ICPP
2006
IEEE
16 years 28 days ago
2006
IEEE
We present the first parallel algorithm for building a Hausdorff Voronoi diagram (HVD). Our algorithm is targeted towards cluster computing architectures and computes the Hausdor...
183
click to vote
EUROPAR
2003
Springer
16 years 3 days ago
2003
Springer
In this paper we propose a new parallel clustering algorithm based on the incremental construction of the compact sets of a collection of objects. This parallel algorithm is portab...
158
click to vote
ESA
1999
Springer
15 years 11 months ago
1999
Springer
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...
187
click to vote
ANSS
1991
IEEE
15 years 10 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...