Sciweavers

1089 search results - page 119 / 218
» Bounds on generalized Frobenius numbers
Sort
View
UAI
2008
13 years 10 months ago
CORL: A Continuous-state Offset-dynamics Reinforcement Learner
Continuous state spaces and stochastic, switching dynamics characterize a number of rich, realworld domains, such as robot navigation across varying terrain. We describe a reinfor...
Emma Brunskill, Bethany R. Leffler, Lihong Li, Mic...
UAI
2001
13 years 10 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
13 years 9 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari
EJC
2010
13 years 9 months ago
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
Julia Böttcher, Klaas P. Pruessmann, Anusch T...
DM
2008
127views more  DM 2008»
13 years 9 months ago
An adjacency lemma for critical multigraphs
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
David Cariolaro