Sciweavers

8699 search results - page 1614 / 1740
» Elements of the Theory of Computation
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
15 years 11 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
ICFP
2005
ACM
15 years 11 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
MOBIHOC
2008
ACM
15 years 11 months ago
Complexity in wireless scheduling: impact and tradeoffs
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...
Yung Yi, Alexandre Proutiere, Mung Chiang
MOBIHOC
2008
ACM
15 years 11 months ago
Analyzing DISH for multi-channel MAC protocols in wireless networks
For long, node cooperation has been exploited as a data relaying mechanism. However, the wireless channel allows for much richer interaction between nodes. One such scenario is in...
Tie Luo, Mehul Motani, Vikram Srinivasan
MOBIHOC
2008
ACM
15 years 11 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
« Prev « First page 1614 / 1740 Last » Next »