Sciweavers

577 search results - page 8 / 116
» Computing Rational Bisectors
Sort
View
ISSAC
2004
Springer
67views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Rational general solutions of algebraic ordinary differential equations
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...
Ruyong Feng, Xiao-Shan Gao
ITA
2000
13 years 7 months ago
Iteration of rational transductions
The purpose of this paper is to show connections between iterated length-preserving rational transductions and linear space computations. Hence, we study the smallest family of tr...
Alain Terlutte, David Simplot
ORL
2007
61views more  ORL 2007»
13 years 7 months ago
Exact solutions to linear programming problems
The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutio...
David Applegate, William J. Cook, Sanjeeb Dash, Da...
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 7 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
COMMA
2008
13 years 9 months ago
A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
Teresa Alsinet, Carlos Iván Chesñeva...