Sciweavers

511 search results - page 60 / 103
» Lower bounds for distributed markov chain problems
Sort
View
AAAI
2007
13 years 10 months ago
Approximate Counting by Sampling the Backtrack-free Search Space
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
Vibhav Gogate, Rina Dechter
SECON
2007
IEEE
14 years 2 months ago
Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
Anand Prabhu Subramanian, Himanshu Gupta, Samir R....
RTAS
2006
IEEE
14 years 1 months ago
Scalable Modeling and Performance Evaluation of Wireless Sensor Networks
A notable features of many proposed Wireless Sensor Networks (WSNs) deployments is their scale: hundreds to thousands of nodes linked together. In such systems, modeling the state...
YoungMin Kwon, Gul Agha
TSP
2008
92views more  TSP 2008»
13 years 7 months ago
Distributed Structures, Sequential Optimization, and Quantization for Detection
Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
Michael A. Lexa, Don H. Johnson
PODC
2010
ACM
13 years 11 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela