Sciweavers

619 search results - page 42 / 124
» Generic Extensions and Generic Polynomials
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
13 years 7 months ago
Rewrite-Based Decision Procedures
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
Maria Paola Bonacina, Mnacho Echenim
JUCS
2007
105views more  JUCS 2007»
13 years 7 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
DEDS
2002
97views more  DEDS 2002»
13 years 7 months ago
N-dimensional Cell-DEVS Models
This article presents an extension to the timed binary Cell-DEVS paradigm. The goal is to allow the modelling of n-dimensional generic cell spaces, including transport or inertial...
Gabriel A. Wainer, Norbert Giambiasi
ADG
2006
Springer
177views Mathematics» more  ADG 2006»
14 years 1 months ago
Recognition of Computationally Constructed Loci
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
Peter Lebmeir, Jürgen Richter-Gebert
ICFP
2006
ACM
14 years 7 months ago
An object-oriented approach to datatype-generic programming
Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented la...
Adriaan Moors, Frank Piessens, Wouter Joosen