641 search results - page 20 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
100
click to vote
AI
2011
Springer
14 years 4 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
EMO
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...
62
Voted
WWW
2004
ACM
15 years 10 months ago
2004
ACM
This paper presents an algorithm to bound the bandwidth of a Web crawler. The crawler collects statistics on the transfer rate of each server to predict the expected bandwidth use...
AMC
2005
14 years 9 months ago
2005
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
SAT
2004
Springer
15 years 3 months ago
2004
Springer
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...