789 search results - page 8 / 158 » Solving Complex Problems Efficiently with Adaptive Automata |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
ANOR
2010
13 years 5 months ago
2010
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
JCST
2008
13 years 7 months ago
2008
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
SIGCSE
2006
ACM
14 years 1 months ago
2006
ACM
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...