787 search results - page 142 / 158 » Polynomial Constants are Decidable |
155
click to vote
IFM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
175
Voted
CORR
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
133
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
161
click to vote
ICDCN
2009
Springer
15 years 11 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
134
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...