Sciweavers

4276 search results - page 58 / 856
» Computability of Probability Distributions and Distribution ...
Sort
View
122
Voted
CCGRID
2003
IEEE
15 years 8 months ago
Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and ...
Kento Aida, Wataru Natsume, Yoshiaki Futakata
164
Voted
FLAIRS
2003
15 years 4 months ago
BUC Algorithm for Iceberg Cubes: Implementation and Sensitivity Analysis
The Iceberg-Cube problem restricts the computation of the data cube to only those group-by partitions satisfying a minimum threshold condition defined on a specified measure. In t...
George E. Nasr, Celine Badr
124
Voted
IAT
2006
IEEE
15 years 9 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 1 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale