Sciweavers

911 search results - page 41 / 183
» Combining programs and state machines
Sort
View
ALT
2005
Springer
14 years 5 months ago
Learnability of Probabilistic Automata via Oracles
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
Omri Guttman, S. V. N. Vishwanathan, Robert C. Wil...
STACS
2010
Springer
14 years 3 months ago
Evolving Multialgebras Unify All Usual Sequential Computation Models
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
Serge Grigorieff, Pierre Valarcher
HYBRID
1998
Springer
14 years 27 days ago
Hybrid cc with Interval Constraints
Abstract. Hybrid cc is a constraint programming language suitable for modeling, controlling and simulating hybrid systems, i.e. systems with continuous and discrete state changes. ...
Björn Carlson, Vineet Gupta
CORR
2004
Springer
140views Education» more  CORR 2004»
13 years 8 months ago
Integrating Defeasible Argumentation and Machine Learning Techniques
The field of machine learning (ML) is concerned with the question of how to construct algorithms that automatically improve with experience. In recent years many successful ML app...
Sergio Alejandro Gómez, Carlos Iván ...
ROBOCUP
2005
Springer
99views Robotics» more  ROBOCUP 2005»
14 years 2 months ago
Keepaway Soccer: From Machine Learning Testbed to Benchmark
Keepaway soccer has been previously put forth as a testbed for machine learning. Although multiple researchers have used it successfully for machine learning experiments, doing so ...
Peter Stone, Gregory Kuhlmann, Matthew E. Taylor, ...