1256 search results - page 60 / 252 » Experiences with the DEVStone benchmark |
145
click to vote
ASPDAC
2001
ACM
15 years 9 months ago
2001
ACM
Abstract- Traditional state-traversal-basedmethods for verifying sequential circuits are computationally infeasible for circuits with a large number of memory elements. However, if...
150
click to vote
EUROPAR
2000
Springer
15 years 9 months ago
2000
Springer
This paper investigates the potential for automatic mapping of typical embedded applications to architectures with multimedia instruction set extensions. For this purpose a (patter...
188
click to vote
AIPS
2008
15 years 8 months ago
2008
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
154
click to vote
ESA
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. The maximum flow problem is a classical optimization problem with many applications. For a long time, HI-PR, an efficient implementation of the highest-label push-relabel...
143
click to vote
AAAI
2010
15 years 7 months ago
2010
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...