10997 search results - page 223 / 2200 » On the Structure of Complete Sets |
187
click to vote
ACSD
2001
IEEE
15 years 10 months ago
2001
IEEE
This paper presents a method for the automatic synthesis of asynchronous circuits from Petri net specifications. The method is based on a structural encoding of the system in such ...
182
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
146
click to vote
ICLP
1995
Springer
15 years 10 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
153
click to vote
ENTCS
2008
15 years 6 months ago
2008
We argue that a realistic model for quantum computations should be general with respect to measurements, and complete with respect to the information flow between the quantum and ...
168
click to vote
DATE
1997
IEEE
15 years 11 months ago
1997
IEEE
A structural, fault-model based methodology for the generation of compact high-quality test sets for analog macros is presented. Results are shown for an IVconverter macro design....