1246 search results - page 90 / 250 » Recursive Timed Automata |
LATA
2010
Springer
15 years 10 months ago
2010
Springer
We study pregroup grammars with letter promotions p(m) q(n) . We show that the Letter Promotion Problem for pregroups is solvable in polynomial time, if the size of p(n)
89
Voted
ACRI
2004
Springer
15 years 6 months ago
2004
Springer
The SLEUTH urban growth model [1] is a cellular automata model that has been widely applied throughout the geographic literature to examine the historic settlement patterns of citi...
116
click to vote
MEMOCODE
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
170
click to vote
FASE
2004
Springer
15 years 4 months ago
2004
Springer
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...
98
Voted
ICIP
2002
IEEE
16 years 2 months ago
2002
IEEE
Bayesian reconstruction methods are slow and have been avoided in 3D ultrasound, since fast algorithms are required. This paper tries to overcome this difficulty by presenting a f...