5448 search results - page 176 / 1090 » Breakpoints and Time in Distributed Computations |
163
click to vote
CONCUR
1999
Springer
15 years 8 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...
153
click to vote
CONCUR
2007
Springer
15 years 8 months ago
2007
Springer
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
147
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Many physical and artificial phenomena can be described by time series. The prediction of such phenomenon could be as complex as interesting. There are many time series forecasti...
117
click to vote
ICDCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the problem of sending messages into the future, commonly known as timed release cryptography. Existing schemes for this task either solve the relative time problem wi...
117
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...