Sciweavers

922 search results - page 149 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
BICOB
2010
Springer
15 years 6 months ago
Algebraic Theory of DNA Recombination
In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. ...
Sergei R. Sverchkov
117
Voted
TYPES
1999
Springer
15 years 6 months ago
Information Retrieval in a Coq Proof Library Using Type Isomorphisms
We propose a method to search for a lemma in a goq proof library by using the lemma type as a key. The method is based on the concept of type isomorphism developed within the funct...
David Delahaye
WADT
1998
Springer
15 years 6 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...
TACAS
1997
Springer
87views Algorithms» more  TACAS 1997»
15 years 6 months ago
Integration in PVS: Tables, Types, and Model Checking
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
Sam Owre, John M. Rushby, Natarajan Shankar
COMPGEOM
1993
ACM
15 years 6 months ago
Worst-Case Bounds for Subadditive Geometric Graphs
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
Marshall W. Bern, David Eppstein