10054 search results - page 1814 / 2011 » On the Complexity of Function Learning |
130
Voted
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
154
Voted
CODES
2007
IEEE
15 years 8 months ago
2007
IEEE
System-level and Platform-based design, along with Transaction Level modeling (TLM) techniques and languages like SystemC, appeared as a response to the ever increasing complexity...
107
click to vote
EXPCS
2007
15 years 8 months ago
2007
Developing kernel-level file systems is a difficult task that requires a significant time investment. For experimental file systems, it is desirable to develop a prototype before ...
126
click to vote
ECBS
2009
IEEE
15 years 8 months ago
2009
IEEE
Future space missions such as the Mars Science Laboratory and Project Constellation suggest the engineering of some of the most complex man-rated software systems. The present pro...
191
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...