6105 search results - page 291 / 1221 » A Parallel Algorithm for Bound-Smoothing |
184
click to vote
ESANN
2008
15 years 8 months ago
2008
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
226
click to vote
IPCO
1998
15 years 8 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
138
click to vote
CP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. The availability of commodity multiprocessors offers significant opportunities for addressing the increasing computational requirements of optimization applications. To...
192
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
195
click to vote
IICAI
2003
15 years 8 months ago
2003
Abstract. This paper presents a new sequential algorithm to answer the question about the existence of a causal explanation for a set of independence statements (a dependency model...