Sciweavers

4894 search results - page 267 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
DATE
2009
IEEE
107views Hardware» more  DATE 2009»
15 years 10 months ago
Sequential logic rectifications with approximate SPFDs
In the digital VLSI cycle, logic transformations are often required to modify the design to meet different synthesis and optimization goals. Logic transformations on sequential ci...
Yu-Shen Yang, Subarna Sinha, Andreas G. Veneris, R...
ATAL
2008
Springer
15 years 8 months ago
Efficient approximate inference in distributed Bayesian networks for MAS-based sensor interpretation
The multiply sectioned Bayesian network (MSBN) framework is the most studied approach for distributed Bayesian Network inference in an MAS setting. This paper describes a new fram...
Norman Carver
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
15 years 8 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
LWA
2008
15 years 8 months ago
Weighted Voting as Approximate MAP Prediction in Pairwise Classification
Weighted voting is the commonly used strategy for combining predictions in pairwise classification. Even though it shows excellent performance in practice, it is often criticized ...
Eyke Hüllermeier, Stijn Vanderlooy
165
Voted
OPODIS
2008
15 years 8 months ago
Distributed Approximation of Cellular Coverage
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
Boaz Patt-Shamir, Dror Rawitz, Gabriel Scalosub