1568 search results - page 28 / 314 » The problem of examination questions in algorithmics |
CACM
2010
14 years 10 months ago
2010
We introduce and analyze a natural algorithm for multi-venue exploration from censored data, which is motivated by the Dark Pool Problem of modern quantitative finance. We prove t...
AAAI
1996
14 years 11 months ago
1996
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...
WSC
2008
15 years 10 days ago
2008
In this paper, we present a comparative study of different stochastic components of genetic algorithms for simulationbased optimisation of the buffer allocation problem. We explor...
WINE
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of assigning prices to goods of fixed marginal cost in order to maximize revenue in the presence of single-minded customers. We focus in particular on the...
102
click to vote
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...