2698 search results - page 99 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
160
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
163
click to vote
TNN
2008
15 years 6 months ago
2008
In this paper, it is found that the weights of a perceptron are bounded for all initial weights if there exists a nonempty set of initial weights that the weights of the perceptron...
151
click to vote
JDA
2007
15 years 6 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
172
click to vote
RECOMB
2010
Springer
15 years 4 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
178
click to vote
TSP
2008
15 years 6 months ago
2008
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...