358 search results - page 16 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
133
click to vote
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
138
click to vote
DEBS
2009
ACM
15 years 8 months ago
2009
ACM
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
112
Voted
ANCS
2007
ACM
15 years 5 months ago
2007
ACM
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...
119
click to vote
PAA
2008
15 years 1 months ago
2008
We present the study of a data-driven motion synthesis approach based on a 1D affine imagematching equation. We start by deriving the relevant properties of the exact matching oper...
129
Voted
RTSS
2007
IEEE
15 years 8 months ago
2007
IEEE
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system wo...