37 search results - page 8 / 8 » Combining Local Search and Look-Ahead for Scheduling and Con... |
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
IEEEPACT
2007
IEEE
14 years 17 days ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...