10054 search results - page 1670 / 2011 » On the Complexity of Function Learning |
146
click to vote
FMCAD
2009
Springer
16 years 25 days ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
147
click to vote
FMCAD
2009
Springer
16 years 25 days ago
2009
Springer
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...
161
click to vote
FSTTCS
2009
Springer
16 years 25 days ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
172
Voted
GCB
2009
Springer
16 years 25 days ago
2009
Springer
Abstract: The analysis of RNA folding landscapes yields insights into the kinetic folding behavior not available from classical structure prediction methods. This is especially imp...
136
click to vote
ICNC
2009
Springer
16 years 25 days ago
2009
Springer
The main purpose of this paper is to propose an incorporating a grammatical evolution (GE) into the genetic algorithm (GA), called GEGA, and apply it to estimate the compressive s...