2084 search results - page 304 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
CADE
2006
Springer
15 years 10 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
109
click to vote
IJCAI
2007
14 years 11 months ago
2007
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive quer...
IPCCC
2007
IEEE
15 years 4 months ago
2007
IEEE
- This paper presents a unique approach for a model-based admission control algorithm for the IEEE 802.11e Enhanced Distributed Channel Access (EDCA) standard. The analytical model...
ASPDAC
1995
ACM
15 years 1 months ago
1995
ACM
- In this paper, we present a new scheduling algorithms that generates area-efficient register transfer level datapaths with multiport memories. The proposed scheduling algorithm a...