Sciweavers

4013 search results - page 191 / 803
» computer 2002
Sort
View
MOC
2002
149views more  MOC 2002»
15 years 3 months ago
Sparse squares of polynomials
We answer a question left open in an article of Coppersmith and Davenport which proved the existence of polynomials whose powers are sparse, and in particular polynomials whose squ...
John Abbott
CG
2002
Springer
15 years 3 months ago
Robust adaptive polygonal approximation of implicit curves
We present an algorithm for computing a robust adaptive polygonal approximation of an implicit curve in the plane. The approximation is adapted to the geometry of the curve because...
Hélio Lopes, João Batista S. de Oliv...
SOFTWARE
2002
15 years 3 months ago
A Query-Driven Anytime Algorithm for Argumentative and Abductive Reasoning
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
Rolf Haenni
COMPUTING
2002
80views more  COMPUTING 2002»
15 years 3 months ago
A Method for Approximate Inversion of the Hyperbolic CDF
It has been observed by E. Eberlein and U. Keller that the hyperbolic distribution fits logarithmic rates of returns of a stock much better than the normal distribution. We give a...
Gunther Leobacher, Friedrich Pillichshammer
GPEM
2002
134views more  GPEM 2002»
15 years 3 months ago
Genetic Programming and Autoconstructive Evolution with the Push Programming Language
Push is a programming language designed for the expression of evolving programs within an evolutionary computation system. This article describes Push and illustrates some of the o...
Lee Spector, Alan J. Robinson