3317 search results - page 638 / 664 » Strategies in Rigid-Variable Methods |
IPPS
1997
IEEE
14 years 21 days ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
ICALP
1993
Springer
14 years 17 days ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
SIGGRAPH
1994
ACM
14 years 17 days ago
1994
ACM
The use of double-buffered displays, in which the previous image is displayed until the next image is complete, can impair the interactivity of systems that require tight coupling...
GECCO
2007
Springer
14 years 11 days ago
2007
Springer
Recently, evolutionary computation has been successfully integrated into statistical learning methods. A Support Vector Machine (SVM) using evolution strategies for its optimizati...
CASES
2006
ACM
14 years 6 days ago
2006
ACM
When integrating software threads together to boost performance on a processor with instruction-level parallel processing support, it is rarely clear which code regions should be ...