4190 search results - page 349 / 838 » Type Class Directives |
157
click to vote
JGAA
2006
15 years 5 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
195
click to vote
JOT
2007
15 years 5 months ago
2007
machines raise the abstraction level of the execution environment at the cost of restricting the set of supported languages. Moreover, the ability of a language implementation to i...
184
click to vote
CN
2002
15 years 4 months ago
2002
An analytical framework for modeling a network of Random Early Detection (RED) queues with mixed traffic types (e.g. TCP and UDP) is developed. Expressions for the steady state go...
128
click to vote
ML
2007
ACM
15 years 4 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
138
click to vote
IJFCS
2010
15 years 3 months ago
2010
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (...