Most implementations of AND-parallelism tackle the shared variable problem by running literals in parallel only if they have no variables in common and thus are independent from e...
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
The difficulty of efficiently reordering the rules in an Access Control List is considered and the essential optimisation problem formulated. The complexity of exact and sophistic...
Search engines provide cached copies of indexed content so users will have something to “click on” if the remote resource is temporarily or permanently unavailable. Depending ...
This paper describes a novel approach to the parameterization of triangle meshes representing 2-manifolds with an arbitrary genus. A topology-based decomposition of the shape is c...