9842 search results - page 1951 / 1969 » The Complexity of the Matching-Cut Problem |
WMPI
2004
ACM
14 years 28 days ago
2004
ACM
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
WOSS
2004
ACM
14 years 28 days ago
2004
ACM
Complex distributed Internet services form the basis not only of e-commerce but increasingly of mission-critical networkbased applications. What is new is that the workload and in...
ECAI
2004
Springer
14 years 27 days ago
2004
Springer
d abstract)1 Niek Bergboer Eric Postma Jaap van den Herik Institute for Knowledge and Agent Technology, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht It is well known t...
EMSOFT
2004
Springer
14 years 27 days ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
ESOP
2004
Springer
14 years 27 days ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...