Sciweavers

530 search results - page 79 / 106
» Bounds on marginal probability distributions
Sort
View
TCS
2008
13 years 8 months ago
Solving NP-complete problems in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
Yuriy Brun
TWC
2008
194views more  TWC 2008»
13 years 8 months ago
Optimal Power Scheduling for Correlated Data Fusion in Wireless Sensor Networks via Constrained PSO
Optimal power scheduling for distributed detection in a Gaussian sensor network is addressed for both independent and correlated observations. We assume amplify-and-forward local p...
Thakshila Wimalajeewa, Sudharman K. Jayaweera
CPC
2004
98views more  CPC 2004»
13 years 8 months ago
And/Or Trees Revisited
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
Brigitte Chauvin, Philippe Flajolet, Danièl...
CN
2006
82views more  CN 2006»
13 years 8 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
JAL
2008
74views more  JAL 2008»
13 years 8 months ago
Solving satisfiability in the tile assembly model with a constant-size tileset
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
Yuriy Brun