1695 search results - page 300 / 339 » Linear, Polynomial or Exponential |
123
click to vote
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
84
Voted
DAC
2010
ACM
15 years 4 months ago
2010
ACM
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
140
click to vote
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
88
Voted
CONCUR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register imp...