5100 search results - page 672 / 1020 » The Linear Complexity of a Graph |
155
click to vote
CONCUR
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. In a trace-based world, the modular speci cation, veri cation, and control of live systems require each module to be receptive that is, each module must be able to meet i...
179
click to vote
POPL
1996
ACM
15 years 10 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
175
click to vote
NN
1997
Springer
15 years 10 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
171
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
176
click to vote
CGO
2004
IEEE
15 years 10 months ago
2004
IEEE
Static Single Assignment form is an intermediate representation that uses instructions to merge values at each confluent point of the control flow graph. instructions are not ma...