1743 search results - page 186 / 349 » Generalized Modal Satisfiability |
193
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
188
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
157
click to vote
EUROCRYPT
2003
Springer
15 years 11 months ago
2003
Springer
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
177
click to vote
LCTRTS
2001
Springer
15 years 10 months ago
2001
Springer
This paper presents an end-to-end synthesis technique for lowpower distributed real-time system design. This technique synthesizes supply voltages of resources to optimize system-...
143
click to vote
SAS
1999
Springer
15 years 10 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...