152 search results - page 18 / 31 » An Experimental Study of Random Knapsack Problems |
109
Voted
TMC
2008
15 years 16 days ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
106
Voted
JCO
2010
14 years 11 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
107
Voted
SPIRE
2010
Springer
14 years 11 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
134
Voted
KDD
2012
ACM
13 years 3 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
101
click to vote
ICCAD
2008
IEEE
15 years 9 months ago
2008
IEEE
—When manufacturing nano-devices, defects are a certainty and reliability becomes a critical issue. Until now, the most pervasive methods used to address reliability, involve inj...