Sciweavers

11716 search results - page 123 / 2344
» Computable symbolic dynamics
Sort
View
ICFP
1998
ACM
15 years 10 months ago
Functional Differentiation of Computer Programs
We present a purely functional implementation of the computational differentiation tools — the well known numeric (i.e., not symbolic) techniques which permit one to compute poin...
Jerzy Karczmarczuk
COCOA
2009
Springer
15 years 10 months ago
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki...
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
15 years 12 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
AISC
2004
Springer
15 years 11 months ago
New Developments in Symmetry Breaking in Search Using Computational Group Theory
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
Tom Kelsey, Steve Linton, Colva M. Roney-Dougal
AIS
2000
Springer
15 years 6 months ago
A comparison between Maya hieroglyphs and computer icons
Interface design normally follows the traditional approach of Art and Design, which requires reworking to refine an idea through visual playfulness until a solution has been achiev...
Paul Honeywill