1080 search results - page 18 / 216 » Problem dependent optimization (PDO) |
186
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
173
click to vote
NETCOOP
2007
Springer
16 years 15 days ago
2007
Springer
In this paper we study a pursuit problem in the context of a wireless sensor network, where the pursuer (i.e., mobile sink) trying to capture a pursuee (i.e., tracked object), movi...
147
click to vote
ICCD
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper describes a novel approach to nd a tighter bound of the transformation of the Min-Max problems into the one of Least-Square Estimation. It is well known that the above ...
166
click to vote
AAAI
2007
15 years 8 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
146
click to vote
COCOON
1998
Springer
15 years 10 months ago
1998
Springer
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...