3229 search results - page 615 / 646 » The Theory of Timed Automata |
FSTTCS
1992
Springer
13 years 11 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally c...
CASES
2007
ACM
13 years 11 months ago
2007
ACM
Embedded systems are often used in safety-critical environments. Thus, thorough testing of them is mandatory. A quite active research area is the automatic test-case generation fo...