5329 search results - page 59 / 1066 » The Weighted Majority Algorithm |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
DAM
2000
13 years 7 months ago
2000
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
SAT
2005
Springer
14 years 1 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
AAIM
2008
Springer
13 years 9 months ago
2008
Springer
Many recommendation systems suggest items to users by utilizing the techniques of collaborative filtering (CF) based on historical records of items that the users have viewed, purc...
JCC
2008
13 years 7 months ago
2008
: We propose the algorithm to evaluate the Coulomb potential in the ab initio density functional calculation on the graphics processor unit (GPU). The numerical accuracy required f...