152 search results - page 3 / 31 » An Experimental Study of Random Knapsack Problems |
WSC
1998
13 years 7 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
WEA
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
CORR
2010
Springer
13 years 29 days ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
JPDC
2010
13 years 24 days ago
2010
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
VLSID
2009
IEEE
14 years 6 months ago
2009
IEEE
Many system-level design tasks (e.g. timing analysis, hardware/software partitioning and design space exploration) involve computational kernels that are intractable (usually NP-ha...