874 search results - page 11 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
CIAC
2000
Springer
13 years 12 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
Evolutionary Algorithms (EAs) are effective and robust methods for solving many practical problems such as feature selection, electrical circuits synthesis, and data mining. Howeve...
ISPAN
2002
IEEE
14 years 14 days ago
2002
IEEE
Index is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection,...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
ISPDC
2010
IEEE
13 years 6 months ago
2010
IEEE
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...