Sciweavers

513 search results - page 73 / 103
» Finitely Based, Finite Sets of Words
Sort
View
COLT
2006
Springer
15 years 3 months ago
Learning Rational Stochastic Languages
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
François Denis, Yann Esposito, Amaury Habra...
FS
2006
84views more  FS 2006»
14 years 11 months ago
Iterative construction of the optimal Bermudan stopping time
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...
Anastasia Kolodko, John Schoenmakers
JSC
2006
102views more  JSC 2006»
14 years 11 months ago
Counting and locating the solutions of polynomial systems of maximum likelihood equations, I
In statistics, mixture models consisting of several component subpopulations are used widely to model data drawn from heterogeneous sources. In this paper, we consider maximum lik...
Max-Louis G. Buot, Donald St. P. Richards
MOR
2006
79views more  MOR 2006»
14 years 11 months ago
The Value of Markov Chain Games with Lack of Information on One Side
We consider a two-player zero-sum game given by a Markov chain over a finite set of states K and a family of zero-sum matrix games (Gk)kK. The sequence of states follows the Marko...
Jérôme Renault
SIAMCO
2002
77views more  SIAMCO 2002»
14 years 11 months ago
Robust Optimal Switching Control for Nonlinear Systems
Abstract. We formulate a robust optimal control problem for a general nonlinear system with finitely many admissible control settings and with costs assigned to switching of contro...
Joseph A. Ball, Jerawan Chudoung, Martin V. Day