641 search results - page 25 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
118
Voted
CP
2011
Springer
14 years 1 months ago
2011
Springer
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
127
click to vote
ACL
2006
15 years 3 months ago
2006
Recent developments in statistical modeling of various linguistic phenomena have shown that additional features give consistent performance improvements. Quite often, improvements...
115
Voted
RTAS
1998
IEEE
15 years 6 months ago
1998
IEEE
Static timing analyzers need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. ...
130
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
For a grid middleware to perform resource allocation, prediction models are needed, which can determine how long an application will take for completion on a particular platform o...
113
click to vote
ESA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...