Sciweavers

123 search results - page 8 / 25
» The minimum Manhattan network problem: Approximations and ex...
Sort
View
UAI
2003
13 years 8 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 6 months ago
Approximating Transitivity in Directed Networks
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
TON
2010
168views more  TON 2010»
13 years 1 months ago
Engineering Wireless Mesh Networks: Joint Scheduling, Routing, Power Control, and Rate Adaptation
Abstract--We present a number of significant engineering insights on what makes a good configuration for medium- to largesize wireless mesh networks (WMNs) when the objective funct...
Jun Luo, Catherine Rosenberg, André Girard
MOBIQUITOUS
2007
IEEE
14 years 1 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
TON
2010
197views more  TON 2010»
13 years 5 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...