4114 search results - page 18 / 823 » Efficient Algorithms for the 2-Center Problems |
103
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper provides analysis to a generalized version of the coupon collector problem, in which the collector gets d coupons each run and he chooses the one that he has the least ...
285
click to vote
GECCO
2011
Springer
14 years 7 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
153
click to vote
ICIC
2007
Springer
15 years 10 months ago
2007
Springer
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...
134
click to vote
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
113
click to vote
ICMLA
2004
15 years 5 months ago
2004
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...