Sciweavers

557 search results - page 7 / 112
» A Type-Coercion Problem in Computer Algebra
Sort
View
AMC
2005
195views more  AMC 2005»
13 years 7 months ago
A new symbolic computational approach to singular initial value problems in the second-order ordinary differential equations
This paper presents a new symbolic algorithm to compute the singular initial value problem of second-order ordinary differential equations using Adomian decomposition method. The ...
Onur Kiymaz, Seref Mirasyedioglu
AB
2008
Springer
14 years 1 months ago
Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
Abstract. Symbolic methods for investigating Hopf bifurcation problems of vector fields arising in the context of algebraic biology have recently obtained renewed attention. Howev...
Thomas Sturm, Andreas Weber 0004
CIRA
2007
IEEE
136views Robotics» more  CIRA 2007»
14 years 1 months ago
Algebraic interval constraint driven exploration in human-agent collaborative problem solving
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...
Yan Wang
DIMACS
2001
13 years 9 months ago
Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
Thorsten Theobald
CSR
2009
Springer
13 years 8 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper