3049 search results - page 293 / 610 » On the Convergence of Bound Optimization Algorithms |
174
Voted
ESA
2005
Springer
16 years 5 days ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
165
click to vote
QEST
2008
IEEE
16 years 1 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
164
click to vote
NIPS
2007
15 years 8 months ago
2007
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
194
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
168
Voted
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministi...