Sciweavers

2374 search results - page 152 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
IPPS
2005
IEEE
15 years 8 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
ISPAN
2002
IEEE
15 years 7 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
ATAL
2007
Springer
15 years 8 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
CSDA
2007
172views more  CSDA 2007»
15 years 2 months ago
AMCMC: An R interface for adaptive MCMC
We describe AMCMC, a software package for running adaptive MCMC algorithms on user-supplied density functions. AMCMC provides the user with an R interface, which in turn calls C pr...
Jeffrey S. Rosenthal
COCO
2005
Springer
153views Algorithms» more  COCO 2005»
15 years 8 months ago
Average-Case Computations - Comparing AvgP, HP, and Nearly-P
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
Arfst Nickelsen, Birgit Schelm