85 search results - page 17 / 17 » Decidability of Trajectory-Based Equations |
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
NIPS
2000
13 years 6 months ago
2000
How should we decide among competing explanations of a cognitive process given limited observations? The problem of model selection is at the heart of progress in cognitive scienc...
CORR
2009
Springer
13 years 2 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...
TCS
2011
12 years 11 months ago
2011
In this paper, we introduce block insertion and deletion on trajectories, which provide us with a new framework to study properties of language operations. With the parallel synta...
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...