4083 search results - page 386 / 817 » The EvA2 Optimization Framework |
202
click to vote
ASPLOS
2010
ACM
15 years 12 months ago
2010
ACM
Heterogeneous systems, systems with multiple processors tailored for specialized tasks, are challenging programming environments. While it may be possible for domain experts to op...
204
click to vote
CCO
2001
Springer
15 years 11 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...
177
click to vote
SIGCOMM
1999
ACM
15 years 11 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
142
click to vote
GECCO
1999
Springer
15 years 11 months ago
1999
Springer
This paper analyses Rosca's ARL as a general framework for automatic subroutine discovery. We review and compare a number of heuristics for code selection, and experimentally...
217
click to vote
DAGSTUHL
2009
15 years 8 months ago
2009
Self-adaptive component-based architectures facilitate the building of systems capable of dynamically adapting to varying execution context. Such a dynamic adaptation is particular...