6894 search results - page 88 / 1379 » Generation Problems |
173
click to vote
EMO
2003
Springer
15 years 11 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
145
click to vote
INFOVIS
2000
IEEE
15 years 10 months ago
2000
IEEE
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...
144
click to vote
GCB
2000
Springer
15 years 10 months ago
2000
Springer
In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this w...
127
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
The Prize Collecting Traveling Salesman Problem (PCTSP) can be associated to a salesman that collects a prize in each city visited and pays a penalty for each city not visited, wit...
141
click to vote
WSC
2004
15 years 7 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...