15 search results - page 1 / 3 » Polynomial General Solutions for First Order Autonomous ODEs |
GIAE
2004
Springer
13 years 10 months ago
2004
Springer
For a first order autonomous ODE, we give a polynomial time algorithm to decide whether it has a polynomial general solution and to compute one if it exists. Experiments show that...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
We give a necessary and sufficient condition for an algebraic ODE to have a rational type general solution. For an autonomous first order ODE, we give an algorithm to compute a r...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we give a necessary and sufficient condition for an algebraic ODE to have an algebraic general solution. For an autonomous first order ODE, we give an optimized bo...
AIPS
2007
13 years 7 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...