1563 search results - page 120 / 313 » Performance comparison of memetic algorithms |
135
Voted
NIPS
1998
15 years 4 months ago
1998
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
136
Voted
BNCOD
2009
15 years 4 months ago
2009
A lot of research has been done on answering single-item queries, only a few have looked at answering multiple-item queries in data broadcast systems. The few that did, have propos...
136
Voted
JMLR
2010
14 years 10 months ago
2010
This paper introduces a Bayesian algorithm for constructing predictive models from data that are optimized to predict a target variable well for a particular instance. This algori...
105
Voted
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
130
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. This paper introduces a modified PSO, Non-dominated Sorting Particle Swarm Optimizer (NSPSO), for better multiobjective optimization. NSPSO extends the basic form of PSO...