1603 search results - page 49 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
110
click to vote
ALGOSENSORS
2007
Springer
15 years 2 months ago
2007
Springer
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
123
click to vote
TASE
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...