3690 search results - page 85 / 738 » Computation with classical sequents |
HIPEAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. High end routers are targeted at providing worst case throughput guarantees over latency. Caches on the other hand are meant to help latency not throughput in a tradition...
GI
2004
Springer
15 years 3 months ago
2004
Springer
: The concept of Massively Multiplayer Games (MMG) recently has spread into all classical genres of real-time computer games. This paper summarizes our work on a novel proxy server...
CONCUR
2001
Springer
15 years 2 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
FAW
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
TC
2008
14 years 9 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...