526 search results - page 4 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
ICCAD
1997
IEEE
14 years 2 months ago
1997
IEEE
In this paper, we present an optimal algorithm for solving the simultaneous technology mapping and linear placement problem for tree-structured circuits with the objective of mini...
ICMAS
2000
13 years 11 months ago
2000
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
IPPS
2002
IEEE
14 years 2 months ago
2002
IEEE
Multipartitioning is a strategy for parallelizing computations that require solving 1D recurrences along each dimension of a multi-dimensional array. Previous techniques for multi...
CEC
2009
IEEE
13 years 7 months ago
2009
IEEE
-- Most optimization algorithms that use probabilistic models focus on extracting the information from good solutions found in the population. A selection method discards the below...
OOPSLA
2005
Springer
14 years 3 months ago
2005
Springer
Designing component-based application that meets performance requirements remains a challenging problem, and usually requires a prototype to be constructed to benchmark performanc...