1712 search results - page 310 / 343 » A Computational Approach to Binding Theory |
121
click to vote
SAC
2010
ACM
15 years 8 months ago
2010
ACM
While the trust paradigm is essential to broadly extend the communication between the environment’s actors, the evaluation of trust becomes a challenge when confronted with init...
111
click to vote
CONEXT
2009
ACM
15 years 2 months ago
2009
ACM
The behavior of routing protocols during convergence is critical as it impacts end-to-end performance. Network convergence is particularly important in BGP, the current interdomai...
135
click to vote
COMPUTING
2008
15 years 1 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
125
click to vote
JUCS
2010
14 years 8 months ago
2010
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...
120
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...