1120 search results - page 85 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
CCO
2001
Springer
14 years 1 months 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...
IEEEPACT
2009
IEEE
14 years 4 months ago
2009
IEEE
Parallel programming is a requirement in the multi-core era. One of the most promising techniques to make parallel programming available for the general users is the use of parall...
FSKD
2008
Springer
13 years 10 months ago
2008
Springer
The trajectory pattern mining problem has recently attracted increasing attention. This paper precisely addresses the parallel mining problem of trajectory patterns as well as the...
OTM
2007
Springer
14 years 3 months ago
2007
Springer
Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL ta...
SBACPAD
2007
IEEE
14 years 3 months ago
2007
IEEE
Multi-dimensional imaging techniques involve the processing of high resolution images commonly used in medical, civil and remote-sensing applications. A barrier commonly encounter...