Sciweavers

1105 search results - page 135 / 221
» Linear choosability of graphs
Sort
View
MEMBRANE
2004
Springer
15 years 10 months ago
Evolution and Oscillation in P Systems: Applications to Biological Phenomena
Some computational aspects and behavioral patterns of P systems are considered, emphasizing dynamical properties that turn useful in characterizing the behavior of biological and b...
Vincenzo Manca, Luca Bianco, Federico Fontana
GECCO
2003
Springer
15 years 10 months ago
Hybrid Networks of Evolutionary Processors
Abstract. A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph and can perform one simple operation only on the w...
Carlos Martín-Vide, Victor Mitrana, Mario J...
DAC
1999
ACM
15 years 9 months ago
Circuit Complexity Reduction for Symbolic Analysis of Analog Integrated Circuits
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
Walter Daems, Georges G. E. Gielen, Willy M. C. Sa...
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
15 years 9 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 8 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan