626 search results - page 70 / 126 » On Approximability of Minimum Bisection Problem |
IJSNET
2007
14 years 9 months ago
2007
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...
107
click to vote
PODS
2012
ACM
13 years 6 days ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
CPM
1999
Springer
15 years 2 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
108
click to vote
TEC
2008
14 years 9 months ago
2008
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...