9842 search results - page 407 / 1969 » The Complexity of the Matching-Cut Problem |
109
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
157
click to vote
JAR
2006
15 years 4 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
118
click to vote
DM
1998
15 years 4 months ago
1998
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...
136
Voted
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS)...
246
Voted
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...