Sciweavers

13414 search results - page 293 / 2683
» The distributed boosting algorithm
Sort
View
IJAR
2006
103views more  IJAR 2006»
15 years 6 months ago
Computing mean and variance under Dempster-Shafer uncertainty: Towards faster algorithms
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
Vladik Kreinovich, Gang Xiang, Scott Ferson
SPAA
2009
ACM
16 years 7 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
PDCAT
2004
Springer
16 years 12 hour ago
An Optimal Broadcasting Algorithm for de Bruijn Network dBG(d, k)
Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorit...
Ngoc Chi Nguyen, Sungyoung Lee
HPCC
2005
Springer
16 years 5 days ago
Parallel Branch and Bound Algorithms on Internet Connected Workstations
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...
Randi Moe, Tor Sørevik
OL
2011
190views Neural Networks» more  OL 2011»
15 years 1 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal