12950 search results - page 297 / 2590 » On Optimal Timed Strategies |
157
click to vote
COMPSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
158
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The generic Multi-objective Evolutionary Algorithm (MOEA) aims to produce Pareto-front approximations with good convergence and diversity property. To achieve convergence, most mu...
175
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
206
click to vote
CIMCA
2008
IEEE
16 years 1 months ago
2008
IEEE
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
150
click to vote
ESA
2004
Springer
16 years 3 days ago
2004
Springer
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...