9842 search results - page 1649 / 1969 » The Complexity of the Matching-Cut Problem |
146
click to vote
PET
2004
Springer
16 years 1 days ago
2004
Springer
Internet computing technologies, like grid computing, enable a weak computational device connected to such a grid to be less limited by its inadequate local computational, storage,...
194
click to vote
SEKE
2004
Springer
16 years 22 hour ago
2004
Springer
One of the challenging research problems in validating a software engineering methodology (SEM), and a part of its validation process, is to answer “How to fairly collect, presen...
144
click to vote
STACS
2004
Springer
16 years 20 hour ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
183
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
154
click to vote
IAT
2003
IEEE
15 years 12 months ago
2003
IEEE
Multi-item, multi-unit negotiations in industrial procurement pose serious challenges to buying agents when trying to determine the best set of providering agents’ offers. Typic...