2950 search results - page 18 / 590 » Computing with Infinitely Many Processes |
MTDT
1999
IEEE
14 years 1 months ago
1999
IEEE
Continuing improvements in semiconductor fabrication density are enabling new classes of System-on-aChip architectures that combine extensive processing logic and high-density mem...
WSNA
2003
ACM
14 years 2 months ago
2003
ACM
In this paper we explore the network level architecture of distributed sensor systems that perform in-network processing. We propose a system with heterogeneous nodes that organiz...
LFCS
1992
Springer
14 years 24 days ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
JUCS
2006
13 years 8 months ago
2006
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
FOSSACS
2007
Springer
14 years 18 days ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...