159 search results - page 29 / 32 » Computing minimum cuts by randomized search heuristics |
WWW
2006
ACM
16 years 1 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
EDBT
2006
ACM
16 years 14 days ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
118
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
COR
2008
15 years 13 days ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
104
Voted
MASCOTS
2003
15 years 1 months ago
2003
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...