Sciweavers

1884 search results - page 204 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
WDAG
2010
Springer
158views Algorithms» more  WDAG 2010»
15 years 4 months ago
Distributed Contention Resolution in Wireless Networks
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...
Thomas Kesselheim, Berthold Vöcking
CORR
2011
Springer
189views Education» more  CORR 2011»
15 years 1 months ago
Fast Set Intersection in Memory
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
Bolin Ding, Arnd Christian König
LATA
2012
Springer
14 years 1 months ago
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
Arne Meier, Johannes Schmidt, Michael Thomas, Heri...
EDBT
2008
ACM
135views Database» more  EDBT 2008»
16 years 6 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
INFOCOM
2008
IEEE
16 years 23 days ago
Association Control in Mobile Wireless Networks
—As mobile nodes roam in a wireless network, they continuously associate with different access points and perform handoff operations. However, these handoffs can potentially incu...
Minkyong Kim, Zhen Liu, Srinivasan Parthasarathy 0...