2109 search results - page 336 / 422 » Solving Necklace Constraint Problems |
122
click to vote
COR
2008
15 years 4 months ago
2008
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
134
click to vote
EOR
2010
15 years 4 months ago
2010
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
131
click to vote
EAAI
2008
15 years 4 months ago
2008
Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buying agents when trying to determine the best set of provid...
148
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
151
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...