352 search results - page 26 / 71 » On the optimal reachability problem of weighted timed automa... |
DEDS
2010
13 years 7 months ago
2010
We study approaches that fit a linear combination of basis functions to the continuation value function of an optimal stopping problem and then employ a greedy policy based on the...
COLT
1994
Springer
13 years 11 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
ECAI
2010
Springer
13 years 7 months ago
2010
Springer
AI Planning is concerned with the selection of actions towards achieving a goal. Research on cellular automata (CA) is concerned with the question how global behaviours arise from ...
DAM
2006
13 years 7 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
SBRN
2000
IEEE
14 years 18 hour ago
2000
IEEE
d Articles >> Table of Contents >> Abstract VI Brazilian Symposium on Neural Networks (SBRN'00) p. 24 Adaptation of Parameters of BP Algorithm Using Automata Hamid...