534 search results - page 84 / 107 » Proving Termination of Rewrite Systems Using Bounds |
TSP
2010
13 years 3 months ago
2010
In this paper, we propose an improved interference cancellation method for two-user multiple access based MIMO communication system. It is shown in the paper, that by using the pr...
EUROCRYPT
2011
Springer
13 years 9 days ago
2011
Springer
In this work, we present HIBE and ABE schemes which are “unbounded” in the sense that the public parameters do not impose additional limitations on the functionality of the sy...
JAIR
2010
13 years 7 months ago
2010
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
PPOPP
2010
ACM
13 years 10 months ago
2010
ACM
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on ...
STOC
2006
ACM
14 years 2 months ago
2006
ACM
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...