2950 search results - page 7 / 590 » Computing with Infinitely Many Processes |
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
CONCUR
2000
Springer
13 years 11 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
LATA
2010
Springer
13 years 11 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
BMVC
1998
13 years 9 months ago
1998
Autocalibration is a difficult problem. Not only is its computation very noisesensitive, but there also exist many critical motions that prevent the estimation of some of the came...
MOC
2002
13 years 7 months ago
2002
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...