169 search results - page 33 / 34 » Efficient search space exploration for HW-SW partitioning |
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
JSA
2000
13 years 5 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
INFOVIS
2005
IEEE
13 years 11 months ago
2005
IEEE
We present the Visual Code Navigator, a set of three interrelated visual tools that we developed for exploring large source code software projects from three different perspective...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
VLDB
1997
ACM
13 years 9 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...