14548 search results - page 423 / 2910 » The Optimal Path-Matching Problem |
201
click to vote
CN
2010
15 years 7 months ago
2010
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
188
click to vote
SIAMJO
2008
15 years 7 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
216
click to vote
SAGA
2005
Springer
16 years 1 months ago
2005
Springer
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization ...
184
click to vote
EMO
2003
Springer
16 years 25 days ago
2003
Springer
We apply the NSGA-II algorithm and its controlled elitist version NSGA-IIc for the intensity modulated beam radiotherapy dose optimization problem. We compare the performance of th...
187
click to vote
ESA
2003
Springer
16 years 25 days ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...