5331 search results - page 202 / 1067 » Algebraic Methods for Optimization Problems |
119
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
102
click to vote
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
— Hypervolume based multiobjective evolutionary algorithms (MOEA) nowadays seem to be the first choice when handling multiobjective optimization problems with many, i.e., at lea...
123
Voted
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
114
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Online prediction methods are typically presented as serial algorithms running on a single processor. However, in the age of web-scale prediction problems, it is increasingly comm...
170
Voted
TEC
2010
14 years 9 months ago
2010
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...