Sciweavers

1684 search results - page 125 / 337
» The lexicographic decision function
Sort
View
DATE
2000
IEEE
108views Hardware» more  DATE 2000»
15 years 8 months ago
Automatic Abstraction for Worst-Case Analysis of Discrete Systems
c Abstraction for Worst-Case Analysis of Discrete Systems Felice Balarin Cadence Berkeley Laboratories Recently, a methodology for worst-case analysis of discrete systems has been...
Felice Balarin
120
Voted
AIPS
2006
15 years 5 months ago
Combining Stochastic Task Models with Reinforcement Learning for Dynamic Scheduling
We view dynamic scheduling as a sequential decision problem. Firstly, we introduce a generalized planning operator, the stochastic task model (STM), which predicts the effects of ...
Malcolm J. A. Strens
122
Voted
FBT
1997
15 years 5 months ago
Rapid Prototyping with AutoFocus
Abstract: In most cases, it is simple inconvenience of use that keeps formal methods from being put to industrial use. This paper argues that functionalities, even though of simple...
Franz Huber, Bernhard Schätz
133
Voted
JMLR
2010
135views more  JMLR 2010»
14 years 10 months ago
Finite-sample Analysis of Bellman Residual Minimization
We consider the Bellman residual minimization approach for solving discounted Markov decision problems, where we assume that a generative model of the dynamics and rewards is avai...
Odalric-Ambrym Maillard, Rémi Munos, Alessa...
238
Voted

Book
796views
17 years 2 months ago
Introduction to Machine Learning
This is an introductory book about machine learning. Notice that this is a draft book. It may contain typos, mistakes, etc. The book covers the following topics: Boolean Functio...
Nils J. Nilsson