9518 search results - page 1867 / 1904 » On Mobility of Software Processes |
CCO
2001
Springer
14 years 3 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...
SIGGRAPH
2010
ACM
14 years 2 days ago
2010
ACM
Although there has been much interest in computational photography
within the research and photography communities, progress
has been hampered by the lack of a portable, programm...
SIGADA
2001
Springer
14 years 14 hour ago
2001
Springer
Statement and AbstractProblem Statement and AbstractProblem Statement and AbstractProblem Statement and Abstract The U.S. Navy currently bases the majority of our contact managemen...
HPCA
2000
IEEE
14 years 2 hour ago
2000
IEEE
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
IEEEPACT
2000
IEEE
13 years 12 months ago
2000
IEEE
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...