914 search results - page 97 / 183 » Branch and Bound on the Network Model |
106
click to vote
CONCUR
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Despite much research on the throughput of relaying networks under idealized interference models, many practical wireless networks rely on physical-layer protocols that preclude...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
PERCOM
2006
ACM
15 years 9 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
103
click to vote
IWQOS
2001
Springer
15 years 2 months ago
2001
Springer
Ad-hoc wireless networks consist of mobile nodes interconnected by multi-hop wireless paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastru...