3049 search results - page 448 / 610 » On the Convergence of Bound Optimization Algorithms |
115
click to vote
TACAS
2005
Springer
15 years 9 months ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
182
click to vote
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
144
click to vote
TACAS
2005
Springer
15 years 9 months ago
2005
Springer
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
133
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider a single-cell multiple-input multiple-output (MIMO) downlink channel where linear transmission and reception strategy is employed. The base station (BS) transmitter is...
136
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...