16430 search results - page 381 / 3286 » On Computable Tree Functions |
164
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
An abundance of research e orts in low power logic synthesis have so far been focused on and or or nand nor based logic. A typical approach is to rst generate an initial multi-lev...
183
click to vote
JLP
2007
15 years 6 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
175
click to vote
FCT
2007
Springer
16 years 29 days ago
2007
Springer
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
153
click to vote
ISVC
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. This paper presents a quantitative evaluation of the accuracy of different sphere-tree construction methods when they are used in deformable bodies. The methods evaluate...