9842 search results - page 1956 / 1969 » The Complexity of the Matching-Cut Problem |
PADS
2003
ACM
14 years 22 days ago
2003
ACM
Wireless networks’ models differ from wired ones at least in the innovative dynamic effects of host-mobility and open-broadcast nature of the wireless medium. Topology changes d...
PLDI
2003
ACM
14 years 22 days ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
SIGCOMM
2003
ACM
14 years 22 days ago
2003
ACM
We propose a new objective for network research: to build a fundamentally different sort of network that can assemble itself given high level instructions, reassemble itself as re...
SPAA
2003
ACM
14 years 22 days ago
2003
ACM
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
XMLSEC
2003
ACM
14 years 22 days ago
2003
ACM
As a large quantity of information is presented in XML format on the Web, there are increasing demands for XML security. Until now, research on XML security has been focused on th...