169 search results - page 7 / 34 » Efficient search space exploration for HW-SW partitioning |
107
click to vote
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
CAV
2005
Springer
15 years 5 months ago
2005
Springer
We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (reachable state space) fix-point construc...
88
Voted
ICMCS
2005
IEEE
15 years 5 months ago
2005
IEEE
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
106
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
102
click to vote
DAC
2005
ACM
15 years 1 months ago
2005
ACM
This paper focuses on designing network processing software for embedded processors. Our design flow CRACC represents an efficient path to implementation based on a modular applic...