1368 search results - page 199 / 274 » Perfect Local Computability and Computable Simulations |
160
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
167
click to vote
IPTPS
2005
Springer
15 years 11 months ago
2005
Springer
Application-level multicast on structured overlays often suffer several drawbacks: 1) The regularity of the architecture makes it difficult to adapt to topology changes; 2) the u...
186
click to vote
RTA
2005
Springer
15 years 11 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
157
click to vote
SAC
2004
ACM
15 years 11 months ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
179
Voted
HYBRID
2004
Springer
15 years 11 months ago
2004
Springer
We present a parameter inference algorithm for autonomous stochastic linear hybrid systems, which computes a maximum-likelihood model, given only a set of continuous output data of...