524 search results - page 52 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
APAL
2008
13 years 8 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
ASPDAC
2009
ACM
14 years 14 days ago
2009
ACM
– The phenomenon of digital convergence and increasing application complexity today is motivating the design of chip multiprocessor (CMP) applications with multiple use cases. Mo...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
We develop a general approach for designing scheduling policies for real-time traffic over wireless channels. We extend prior work, which characterizes a real-time flow by its traf...
ISCAS
1999
IEEE
14 years 1 days ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
PODC
1998
ACM
13 years 11 months ago
1998
ACM
A contract is a non-repudiable agreement on a given contract text, i.e., a contract can be used to prove agreement between its signatories to any verifier. A contract signing sche...