1632 search results - page 110 / 327 » On special numberings of hypergraphs |
172
Voted
MMMACNS
2001
Springer
15 years 11 months ago
2001
Springer
The history of the application of formal methods to cryptographic protocol analysis spans nearly twenty years, and recently has been showing signs of new maturity and consolidatio...
165
click to vote
PADO
2001
Springer
15 years 11 months ago
2001
Springer
Tag elimination is a program transformation for removing unnecessary tagging and untagging operations from automatically generated programs. Tag elimination was recently proposed a...
174
click to vote
EH
2000
IEEE
15 years 11 months ago
2000
IEEE
Evolvable Hardware (EHW) has the potential to become a new target hardware for complex real-world applications. However, there are several problems that would have to be solved to...
137
click to vote
ICRA
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper we deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delay...
175
click to vote
STOC
2000
ACM
15 years 11 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...