1729 search results - page 323 / 346 » Bound Graph Polysemy |
150
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
145
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
137
click to vote
IJFCS
2006
15 years 4 months ago
2006
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
158
click to vote
JUCS
2006
15 years 4 months ago
2006
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
149
click to vote
TOC
2008
15 years 4 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...