2126 search results - page 133 / 426 » An optimization algorithm for imprecise multi-objective prob... |
208
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
201
click to vote
UAI
2008
15 years 7 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
169
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
200
click to vote
GECCO
2004
Springer
2004
Springer
Using Clustering Techniques to Improve the Performance of a Multi-objective Particle Swarm Optimizer
15 years 11 months ago
In this paper, we present an extension of the heuristic called “particle swarm optimization” (PSO) that is able to deal with multiobjective optimization problems. Our approach ...
161
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...