425 search results - page 44 / 85 » Polynomial Factorization 1987-1991 |
132
click to vote
MOC
2000
15 years 5 months ago
2000
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often observed robustness. By using a tridiagonal structure...
156
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
261
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
170
click to vote
FOCS
2004
IEEE
15 years 9 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
164
click to vote
AAAI
1997
15 years 7 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...