Sciweavers

1993 search results - page 99 / 399
» Analysis of the Effectiveness of G3PARM Algorithm
Sort
View
TPDS
1998
157views more  TPDS 1998»
14 years 9 months ago
A Compiler Optimization Algorithm for Shared-Memory Multiprocessors
This paper presents a new compiler optimization algorithm that parallelizes applications for symmetric, sharedmemory multiprocessors. The algorithm considers data locality, parall...
Kathryn S. McKinley
WSC
1998
14 years 11 months ago
Using ACCESSIBILITY to Assess the Performance of Generalized Hill Climbing Algorithms
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
Sheldon H. Jacobson, Enver Yücesan
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
15 years 10 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
ACCV
2009
Springer
15 years 4 months ago
A Smarter Particle Filter
Particle filtering is an effective sequential Monte Carlo approach to solve the recursive Bayesian filtering problem in non-linear and non-Gaussian systems. The algorithm is base...
Xiaoqin Zhang, Weiming Hu, Steve J. Maybank
PE
2008
Springer
167views Optimization» more  PE 2008»
14 years 9 months ago
Analysis of ratings on trust inference in open environments
Ratings (also known as recommendations) provide an efficient and effective way to build trust relationship in the human society, by making use of the information from others rathe...
Zhengqiang Liang, Weisong Shi