6036 search results - page 20 / 1208 » Web search solved |
108
click to vote
AISC
2008
Springer
15 years 2 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
136
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
105
Voted
AAAI
2006
15 years 2 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
161
Voted
SOICT
2010
14 years 7 months ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
113
Voted
EVOW
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...