4378 search results - page 622 / 876 » On the Complexity of Ordered Colourings |
200
click to vote
CHARME
1995
Springer
15 years 10 months ago
1995
Springer
In this paper we present a method formodeling asynchronous digital circuits by timed automata. The constructed timed automata serve as \mechanical" and veri able objects for a...
153
click to vote
ZUM
2000
Springer
15 years 10 months ago
2000
Springer
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...
168
click to vote
GD
1995
Springer
15 years 10 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
178
click to vote
HPCA
1995
IEEE
15 years 10 months ago
1995
IEEE
Shared memory is an appealing abstraction for parallel programming. It must be implemented with caches in order toperform well, however, and caches require a coherence mechanism t...
198
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...