438 search results - page 32 / 88 » On Perfect Switching Classes |
121
click to vote
PE
1998
Springer
14 years 11 months ago
1998
Springer
Asymptotic approximations are constructed for the performance measures of product form queueing networks consisting of single server, fixed rate nodes with large populations. The...
WG
2009
Springer
15 years 6 months ago
2009
Springer
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
WG
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
ASM
2008
ASM
15 years 1 months ago
2008
ASM
We address the proof-based development of cryptographic protocols satisfying security properties. Communication channels are supposed to be unsafe. Analysing cryptographic protocol...
ACL
2007
15 years 1 months ago
2007
This paper describes a fully automatic twostage machine learning architecture that learns temporal relations between pairs of events. The first stage learns the temporal attribut...