1007 search results - page 117 / 202 » The Complexity of Futile Questioning |
CACM
2007
15 years 24 days ago
2007
ACTION THE KEY TO COMPUTING? Why is it that some software engineers and computer scientists are able to produce clear, elegant designs and programs, while others cannot? Is it poss...
107
click to vote
ISCI
2008
15 years 23 days ago
2008
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...
83
Voted
ALIFE
2004
15 years 20 days ago
2004
One of the central questions in evolutionary biology concerns the dynamics of adaptation and diversification. This issue can be addressed experimentally if replicate populations ad...
81
Voted
CORR
2004
Springer
15 years 19 days ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
101
click to vote
CPC
2004
15 years 19 days ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...