159 search results - page 8 / 32 » Computing minimum cuts by randomized search heuristics |
110
Voted
PCI
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
108
click to vote
IOR
2006
15 years 10 days ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
111
Voted
GEOINFORMATICA
2002
15 years 4 days ago
2002
The generation of better label placement configurations in maps is a problem that comes up in automated cartographic production. The objective of a good label placement is to displ...
94
Voted
EUSFLAT
2007
15 years 1 months ago
2007
Heuristic search for the global minimum is studied. This paper is focused on the adaptation of control parameters in differential evolution (DE) and in controlled random search (...
WWW
2008
ACM
16 years 1 months ago
2008
ACM
The paper is concerned with the problem of question recommendation. Specifically, given a question as query, we are to retrieve and rank other questions according to their likelih...