Sciweavers

Share
1382 search results - page 1 / 277
» Term ordering problem on MDG
Sort
View
GLVLSI
2002
IEEE
95views VLSI» more  GLVLSI 2002»
10 years 6 months 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
SMA
1999
ACM
106views Solid Modeling» more  SMA 1999»
10 years 5 months ago
Resolving non-uniqueness in design feature histories
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
Vincent A. Cicirello, William C. Regli
INFORMS
2010
147views more  INFORMS 2010»
9 years 10 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
CIKM
2011
Springer
9 years 1 months ago
Lower-bounding term frequency normalization
In this paper, we reveal a common de´Čüciency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
Yuanhua Lv, ChengXiang Zhai
RTA
1993
Springer
10 years 5 months ago
Total Termination of Term Rewriting
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
Maria C. F. Ferreira, Hans Zantema
books