1139 search results - page 29 / 228 » Bounded Ideation Theory |
FSTTCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...
CSL
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
ASIAN
2006
Springer
14 years 20 days ago
2006
Springer
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
UC
2009
Springer
14 years 3 months ago
2009
Springer
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the...
ECRTS
2006
IEEE
14 years 3 months ago
2006
IEEE
In this article we provide a model for the dynamic behavior of media processing chains of tasks communicating via bounded buffers. The aim is to find the overall behavior of a cha...