1086 search results - page 62 / 218 » Jug measuring: Algorithms and complexity |
IJAR
2008
14 years 9 months ago
2008
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
105
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
JPDC
2010
14 years 8 months ago
2010
This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...
DSD
2008
IEEE
15 years 4 months ago
2008
IEEE
Systems on chip (SoC) have much in common with traditional (networked) distributed systems in that they consist of largely independent components with dedicated communication inte...
ICPPW
2005
IEEE
15 years 3 months ago
2005
IEEE
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...