7311 search results - page 256 / 1463 » Time in State Machines |
182
click to vote
COLT
1994
Springer
15 years 11 months ago
1994
Springer
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework tha...
195
click to vote
FMCAD
2000
Springer
15 years 11 months ago
2000
Springer
We take a fresh look at the problem of how to check safety properties of finite state machines. We are particularly interested in checking safety properties with the help of a SAT-...
191
click to vote
DM
2007
15 years 7 months ago
2007
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
212
click to vote
ALGORITHMICA
2002
15 years 7 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
169
click to vote
DNA
2006
Springer
15 years 11 months ago
2006
Springer
P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve i...