2031 search results - page 103 / 407 » On Tree-Constrained Matchings and Generalizations |
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
14 years 9 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
104
click to vote
ANCS
2010
ACM
14 years 7 months ago
2010
ACM
Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount o...
JCT
2011
14 years 4 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. While complex matchings ...