Sciweavers

2095 search results - page 65 / 419
» Improved pebbling bounds
Sort
View
CAV
2004
Springer
128views Hardware» more  CAV 2004»
14 years 3 months ago
Proving More Properties with Bounded Model Checking
Bounded Model Checking, although complete in theory, has been thus far limited in practice to falsification of properties that were not invariants. In this paper we propose a term...
Mohammad Awedh, Fabio Somenzi
STACS
2004
Springer
14 years 3 months ago
A Lower Bound on the Competitive Ratio of Truthful Auctions
We study a class of single-round, sealed-bid auctions for a set of identical items. We adopt the worst case competitive framework defined by [1,2] that compares the profit of an ...
Andrew V. Goldberg, Jason D. Hartline, Anna R. Kar...
AUTOMATICA
2006
81views more  AUTOMATICA 2006»
13 years 10 months ago
An energy-gain bounding approach to robust fuzzy identification
A novel method for the robust identification of interpretable fuzzy models, based on the criterion that identification errors are least sensitive to data uncertainties and modelli...
Mohit Kumar, Norbert Stoll, Regina Stoll
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 10 months ago
Rate Bounds for MIMO Relay Channels Using Message Splitting
This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input singleoutput (SISO) relay ch...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
JAT
2010
61views more  JAT 2010»
13 years 8 months ago
Close-to-optimal bounds for SU(N) loop approximation
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...
Peter Oswald, Tatiana Shingel