565 search results - page 63 / 113 » A Guided Monte Carlo Approach to Optimization Problems |
ISSAC
2005
Springer
15 years 3 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
CSDA
2004
14 years 10 months ago
2004
In this investigation, the problem of estimating the probability density function of a function of m independent identically distributed random variables, g(X1, X2, ..., Xm) is co...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
103
click to vote
ASPDAC
2004
ACM
15 years 3 months ago
2004
ACM
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...