3653 search results - page 205 / 731 » On Recognizable Timed Languages |
226
click to vote
POPL
2008
ACM
16 years 5 months ago
2008
ACM
The subtyping test consists of checking whether a type t is a descendant of a type r (Agrawal et al. 1989). We study how to perform such a test efficiently, assuming a dynamic hie...
168
click to vote
ICFP
2002
ACM
16 years 5 months ago
2002
ACM
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
158
click to vote
TIME
1994
IEEE
15 years 9 months ago
1994
IEEE
Pinto and Reiter have argued that the Situation Calculus, improved with time handling axioms, subsumes the features of linear time temporal formalisms such as Event Calculus and I...
136
click to vote
TIME
2003
IEEE
15 years 10 months ago
2003
IEEE
In bitemporal databases, current facts and transaction states are modelled using a special value to represent the current time (such as a minimum or maximum timestamp or NULL). Pr...
196
click to vote
JMLR
2012
13 years 7 months ago
2012
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...