1686 search results - page 127 / 338 » Programs as polygraphs: computability and complexity |
153
Voted
Publication
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
131
Voted
ACSD
2008
IEEE
15 years 10 months ago
2008
IEEE
In recent years it has become clear that techniques developed for concurrent programming are in fact very useful for the analysis of complex systems in biology. To some level of i...
119
Voted
ESOP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of c...
117
Voted
EH
2004
IEEE
15 years 7 months ago
2004
IEEE
This paper discusses the problem of increased programming time for intrinsic evolvable hardware (EHW) as the complexity of the circuit grows. We develop equations for the size of ...
140
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...