13621 search results - page 153 / 2725 » Computability and Complexity in Self-assembly |
195
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
174
click to vote
JAIR
2008
15 years 6 months ago
2008
Although recent years have seen a surge of interest in the computational aspects of social choice, no specific attention has previously been devoted to elections with multiple win...
165
click to vote
ACL
2010
15 years 4 months ago
2010
We describe the strategy currently pursued for verbalising OWL ontologies by sentences in Controlled Natural Language (i.e., combining generic rules for realising logical patterns...
173
click to vote
DLT
2009
15 years 4 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
175
click to vote
ECCC
2006
15 years 6 months ago
2006
Abstract. Circuits composed of threshold gates (McCulloch-Pitts neurons, or perceptrons) are simplified models of neural circuits with the advantage that they are theoretically mor...