Sciweavers

816 search results - page 85 / 164
» Abstract Barycentric Algebras
Sort
View
PPDP
2007
Springer
14 years 3 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
LOPSTR
2007
Springer
14 years 3 months ago
Denotation by Transformation
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
Bernd Braßel, Jan Christiansen
JCB
1998
105views more  JCB 1998»
13 years 8 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
TVLSI
1998
95views more  TVLSI 1998»
13 years 8 months ago
Bounds on pseudoexhaustive test lengths
Abstract—Pseudoexhaustive testing involves applying all possible input patterns to the individual output cones of a combinational circuit. Based on our new algebraic results, we ...
Rajagopalan Srinivasan, Sandeep K. Gupta, Melvin A...
TEC
2002
183views more  TEC 2002»
13 years 8 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy