13621 search results - page 328 / 2725 » Computability and Complexity in Self-assembly |
147
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
145
click to vote
VAST
2004
ACM
16 years 5 days ago
2004
ACM
The results of a project aimed to the study, reconstruction and presentation to the public of a monument disassembled and dispersed, the mausoleum of the emperor Arrigo VII, are p...
150
click to vote
JELIA
2004
Springer
16 years 3 days ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
167
click to vote
IEEEICCI
2003
IEEE
16 years 19 hour ago
2003
IEEE
This paper describes a system capable of classifying stochastic, self-affine, nonstationary signals produced by nonlinear systems. The classification and analysis of these signals...
163
click to vote
FM
2003
Springer
15 years 12 months ago
2003
Springer
The complexity of embedded controllers is steadily increasing. This trend, stimulated by the continuous improvement of the computational power of hardware, demands for a correspond...