3653 search results - page 190 / 731 » On Recognizable Timed Languages |
159
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper discusses highly general mechanisms for specifying the refinement of a real-time system as a collection of lower level parallel components that preserve the timing and ...
184
click to vote
JMLR
2010
15 years 4 days ago
2010
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
161
Voted
ISORC
2009
IEEE
16 years 3 hour ago
2009
IEEE
The UML goal of being a general-purpose modeling language discards the possibility to adopt too precise and strict a semantics. Users are to refine or define the semantics in th...
125
Voted
CHI
2008
ACM
16 years 5 months ago
2008
ACM
By analyzing features of users' typing, Automatic Whiteout++ detects and corrects up to 32.37% of the errors made by typists while using a mini?QWERTY (RIM Blackberry style) ...
142
Voted
ICDT
2007
ACM
15 years 11 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....