11716 search results - page 171 / 2344 » Computable symbolic dynamics |
170
click to vote
ICPP
1996
IEEE
15 years 10 months ago
1996
IEEE
The ability to automatically parallelize standard programming languages results in program portability across a wide range of machine architectures. It is the goal of the Polaris ...
148
click to vote
ECAI
1992
Springer
15 years 10 months ago
1992
Springer
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
194
click to vote
TASLP
2011
15 years 1 months ago
2011
Abstract—This paper proposes methods for information processing of audio streams using methods of information geometry. We lay the theoretical groundwork for a framework allowing...
140
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
170
click to vote
HICSS
2007
IEEE
16 years 24 days ago
2007
IEEE
— This paper demonstrates how two different sets of powerful domain specific language features can be specified and deployed as composable language extensions. These extensions...