14739 search results - page 188 / 2948 » An optimization problem on the sphere |
81
Voted
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...
FOCS
2004
IEEE
15 years 2 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
153
Voted
ICICIC
2006
IEEE
15 years 5 months ago
2006
IEEE
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
This paper proposes an improved particle swarm optimizer using the notion of species to determine its neighbourhood best values, for solving multimodal optimization problems. In th...
86
Voted
DAGSTUHL
2004
15 years 9 days ago
2004
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...