8486 search results - page 1383 / 1698 » Ordered Enumeration Method |
195
click to vote
EURODAC
1995
IEEE
15 years 10 months ago
1995
IEEE
: We present a new, dynamic algorithm for test sequence compaction and test cycle reduction for combinationaland sequential circuits. Several dynamic algorithms for compaction in c...
200
click to vote
ICCAD
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
205
click to vote
ISTCS
1997
Springer
15 years 10 months ago
1997
Springer
Kearns introduced the "statistical query" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this ...
214
click to vote
ICPP
1995
IEEE
15 years 10 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
163
click to vote
RTA
1991
Springer
15 years 10 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...