3820 search results - page 329 / 764 » Bounded Model Debugging |
156
click to vote
CRYPTO
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
128
click to vote
INFOCOM
1993
IEEE
15 years 8 months ago
1993
IEEE
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
144
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
We present and analyze coalitional affinity games, a family of hedonic games that explicitly model the value that an agent receives from being associated with other agents. We pro...
176
click to vote
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
156
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...