2976 search results - page 197 / 596 » On the bounded integer programming |
159
click to vote
AAAI
1998
15 years 7 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
200
click to vote
AAMAS
2011
Springer
15 years 1 months ago
2011
Springer
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
176
click to vote
GLOBECOM
2008
IEEE
16 years 28 days ago
2008
IEEE
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
170
click to vote
JCT
2000
15 years 6 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
150
click to vote
ICASSP
2008
IEEE
16 years 27 days ago
2008
IEEE
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...