169 search results - page 9 / 34 » Efficient search space exploration for HW-SW partitioning |
PPL
2010
14 years 6 months ago
2010
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...
ATAL
2003
Springer
15 years 4 months ago
2003
Springer
The emerging science of simulation enables us to explore the dynamics of large and complex systems even if a formal representation and analysis of the system is intractable and a ...
95
Voted
ECML
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
ANCS
2006
ACM
15 years 3 months ago
2006
ACM
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
82
Voted
SIGSOFT
2009
ACM
16 years 12 days ago
2009
ACM
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...