Sciweavers

38 search results - page 4 / 8
» Computational Complexity of Generators and Nongenerators in ...
Sort
View
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
ATS
1997
IEEE
87views Hardware» more  ATS 1997»
13 years 11 months ago
A Genetic Algorithm for the Computation of Initialization Sequences for Synchronous Sequential Circuits
Testing circuits which do not include a global reset signal requires either complex ATPG algorithms based on 9- or even 256-valued algebras, or some suitable method to generate in...
Fulvio Corno, Paolo Prinetto, Maurizio Rebaudengo,...
SMA
2009
ACM
157views Solid Modeling» more  SMA 2009»
14 years 2 months ago
Constraint-based model synthesis
We present a method for procedurally modeling general complex 3D shapes. Our approach is targeted towards applications in digital entertainment and gaming and can automatically ge...
Paul Merrell, Dinesh Manocha
IPPS
2008
IEEE
14 years 1 months ago
Build to order linear algebra kernels
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...
Jeremy G. Siek, Ian Karlin, Elizabeth R. Jessup
COMPGEOM
1997
ACM
13 years 11 months ago
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
Hervé Brönnimann, Ioannis Z. Emiris, V...