Sciweavers

1677 search results - page 71 / 336
» On the Completeness of Quantum Computation Models
Sort
View
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
15 years 5 months ago
The Halting Probability in Von Neumann Architectures
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
William B. Langdon, Riccardo Poli
FUIN
2002
88views more  FUIN 2002»
15 years 1 months ago
A Formalization of Transition P Systems
Abstract. In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: trans...
Mario J. Pérez-Jiménez, Fernando San...
SBBD
2004
119views Database» more  SBBD 2004»
15 years 2 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
DAC
1997
ACM
15 years 5 months ago
Modeling Design Tasks and Tools: The Link Between Product and Flow Model
- The important step towards a comprehensive CAD framework is the development of a suitable, complete design model on which the design system’s components are based. To date, we ...
Bernd Schürmann, Joachim Altmeyer
FM
2006
Springer
172views Formal Methods» more  FM 2006»
15 years 5 months ago
The Embedded Systems Design Challenge
We summarize some current trends in embedded systems design and point out some of their characteristics, such as the chasm between analytical and computational models, and the gap ...
Thomas A. Henzinger, Joseph Sifakis