715 search results - page 80 / 143 » Automatic Programming for Sequence Control |
116
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
199
click to vote
ECOOP
2000
Springer
15 years 9 months ago
2000
Springer
We have recently shown how use cases can be systematically transformed into UML state charts considering all relevant information from a use case specification, including pre- and ...
123
Voted
RTAS
1996
IEEE
15 years 9 months ago
1996
IEEE
Real-time programmers have to deal with the problem of relating timing constraints associated with source code to sequences of machine instructions. This paper describes an enviro...
153
click to vote
JMLR
2012
13 years 7 months ago
2012
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
142
Voted
POPL
2010
ACM
16 years 2 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...