1568 search results - page 113 / 314 » The problem of examination questions in algorithmics |
111
click to vote
WDAG
2005
Springer
15 years 10 months ago
2005
Springer
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
126
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. ...
138
click to vote
GI
2009
Springer
15 years 2 months ago
2009
Springer
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...
235
click to vote
ICAART
2010
INSTICC
16 years 1 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
PPSN
1998
Springer
15 years 8 months ago
1998
Springer
This paper examines several niching and elitist models applied to Multiple-Objective Genetic Algorithms (MOGAs). Test cases consider a simple problem as well as multidisciplinary d...