75 search results - page 6 / 15 » On the Complexity of Hopcroft's State Minimization Algorithm |
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
This paper describes an algorithm, called CQ-learning, which learns to adapt the state representation for multi-agent systems in order to coordinate with other agents. We propose ...
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
14 years 27 days ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
JACM
2008
13 years 8 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
KBSE
2007
IEEE
14 years 2 months ago
2007
IEEE
Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the program state. At such a state, it is standard to term...
CLOUD
2010
ACM
14 years 1 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...