Sciweavers

2647 search results - page 22 / 530
» Solving Term Inequalities
Sort
View
GLVLSI
2002
IEEE
95views VLSI» more  GLVLSI 2002»
14 years 11 days ago
Term ordering problem on MDG
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
Yi Feng, Eduard Cerny
IJON
2000
80views more  IJON 2000»
13 years 7 months ago
Synthesis approach for bidirectional associative memories based on the perceptron training algorithm
Bidirectional associative memories are being used extensively for solving a variety of problems related to pattern recognition. In the present paper, a new synthesis approach is d...
Ismail Salih, Stanley H. Smith, Derong Liu
ICA
2012
Springer
12 years 3 months ago
Contrast Functions for Independent Subspace Analysis
We consider the Independent Subspace Analysis problem from the point of view of contrast functions, showing that contrast functions are able to partially solve the ISA problem. Tha...
Jason A. Palmer, Scott Makeig
PPDP
2005
Springer
14 years 27 days ago
Program transformation by templates based on term rewriting
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...
Yuki Chiba, Takahito Aoto, Yoshihito Toyama
WADT
1998
Springer
13 years 11 months ago
Complete Strategies for Term Graph Narrowing
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
Annegret Habel, Detlef Plump