6808 search results - page 774 / 1362 » Distributed Concurrency Control |
187
click to vote
PACT
2001
Springer
15 years 11 months ago
2001
Springer
We introduce the νSPI-calculus that strengthens the notion of “perfect symmetric cryptography” of the spi-calculus by taking time into account. This involves defining an oper...
215
click to vote
IEEEPACT
2000
IEEE
15 years 11 months ago
2000
IEEE
Region-based compilation repartitions a program into more desirable compilation units for optimization and scheduling, particularly beneficial for ILP architectures. With region-...
203
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
154
click to vote
CEAS
2008
Springer
15 years 9 months ago
2008
Springer
The effectiveness of anti-spam techniques is an important question: after all, spam has a real cost to legitimate users in terms of time and resources. The problem is how we deter...
177
click to vote
AIPS
2006
15 years 8 months ago
2006
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...