10568 search results - page 249 / 2114 » Computer Intelligence and Formalization |
133
Voted
EUROCAST
2007
Springer
15 years 7 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
110
click to vote
DAC
2000
ACM
16 years 4 months ago
2000
ACM
Contemporary microprocessors implement many iterative algorithms. For example, the front-end of a microprocessor repeatedly fetches and decodes instructions while updating interna...
133
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
114
click to vote
SAC
2005
ACM
15 years 8 months ago
2005
ACM
E-commerce as well as B2B applications are essentially based on interactions between different people and organizations (e.g. industry, banks, customers) that usually exploit the ...
128
click to vote
FATES
2004
Springer
15 years 8 months ago
2004
Springer
A Time Action Lock is a state of a Real-time system at which neither time can progress nor an action can occur. Time Action Locks are often seen as signs of errors in the model or ...