982 search results - page 136 / 197 » Solving Steiner tree problems in graphs to optimality |
111
Voted
DDECS
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
139
Voted
FOCS
1995
IEEE
15 years 4 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
120
Voted
SAC
2009
ACM
15 years 5 months ago
2009
ACM
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
96
Voted
IJCAI
2001
15 years 1 months ago
2001
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
102
click to vote
PPSN
1992
Springer
15 years 4 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...