276 search results - page 46 / 56 » The Complexity of Computing Maximal Word Functions |
165
Voted
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
169
click to vote
DAGM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
159
Voted
EUROGP
2009
Springer
16 years 28 days ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
164
click to vote
SG
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Modern premium automobiles are equipped with an increasing number of Electronic Control Units (ECUs). These ECUs are interconnected and form a complex network to provide ...
152
Voted
CATE
2004
15 years 7 months ago
2004
Experience from the management of distributed computer-based learning resources in schools has been proven to be inefficient and costly. Though commercial software packages are av...