1469 search results - page 56 / 294 » Approximate polynomial decomposition |
136
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
189
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
165
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
161
click to vote
ICPPW
2005
IEEE
16 years 6 days ago
2005
IEEE
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
174
click to vote
SIAMSC
2008
15 years 6 months ago
2008
This paper presents fast and reliable condition estimates for the roots of a real polynomial based on the method of statistical condition estimation (SCE) by Kenney and Laub. Using...