1732 search results - page 40 / 347 » New Challenges in Parallel Optimization |
CCO
2001
Springer
14 years 13 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
DAC
2009
ACM
14 years 9 months ago
2009
ACM
Computational complexity has been the primary challenge of many VLSI CAD applications. The emerging multicore and manycore microprocessors have the potential to offer scalable perf...
CCGRID
2003
IEEE
14 years 1 months ago
2003
IEEE
Clusters are now composed of non-uniform nodes with different CPUs, disks or network cards so that customers can adapt the cluster configuration to the changing technologies and t...
CLUSTER
2006
IEEE
14 years 2 months ago
2006
IEEE
The increase in the use of parallel distributed architectures in order to solve large-scale scientific problems has generated the need for performance prediction for both determi...
ICS
1994
Tsinghua U.
14 years 7 hour ago
1994
Tsinghua U.
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...