2233 search results - page 299 / 447 » On the Complexity of Theory Curbing |
LATA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
—We are now living in a world where information is growing and updating quickly. Knowledge can be acquired more efficiently with the help of automatic document summarization and...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
ACIVS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Feature subset selection is an important subject when training classifiers in Machine Learning (ML) problems. Too many input features in a ML problem may lead to the so-...
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...