1686 search results - page 285 / 338 » Programs as polygraphs: computability and complexity |
RTCSA
2009
IEEE
15 years 4 months ago
2009
IEEE
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
CSEE
2009
Springer
15 years 4 months ago
2009
Springer
As software engineering educators, it is important for us to realize the increasing domainspecificity of software, and incorporate these changes in our design of teaching material...
SARA
2009
Springer
15 years 4 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— The goal of this paper is to develop modeling techniques for complex systems for the purposes of control, estimation, and inference: (i) A new class of Hidden Markov Models is ...