3653 search results - page 78 / 731 » On Recognizable Timed Languages |
NLDB
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we propose methods and heuristics having high accuracies and low time complexities for filtering spam e-mails. The methods are based on the n-gram approach and a heu...
COLT
1992
Springer
15 years 2 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
AAAI
2004
14 years 11 months ago
2004
In this paper we introduce the language Golog+HTNT I for specifying control using procedural and HTN-based constructs together with deadlines and time restrictions. Our language s...
RTDB
1996
14 years 11 months ago
1996
We are developing an object-oriented real-time database system that includes a relationally complete query language. Unlike conventional query optimizers, our optimizer estimates ...
ACTA
2010
14 years 10 months ago
2010
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...