9842 search results - page 222 / 1969 » The Complexity of the Matching-Cut Problem |
SSS
2009
Springer
14 years 3 months ago
2009
Springer
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
APPROX
2005
Springer
14 years 4 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
CDC
2009
IEEE
14 years 3 months ago
2009
IEEE
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
GLOBECOM
2008
IEEE
14 years 5 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
ICALP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...