641 search results - page 125 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
BMCBI
2007
13 years 9 months ago
2007
Background: Microarray time series studies are essential to understand the dynamics of molecular events. In order to limit the analysis to those genes that change expression over ...
TVLSI
2002
13 years 9 months ago
2002
The performance of many modern computer and communication systems is dictated by the latency of communication pipelines. At the same time, power/energy consumption is often another...
IEEEPACT
1998
IEEE
14 years 2 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...