Sciweavers

1480 search results - page 224 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 3 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
NN
1998
Springer
148views Neural Networks» more  NN 1998»
15 years 3 months ago
ARTMAP-IC and medical diagnosis: Instance counting and inconsistent cases
For complex database prediction problems such as medical diagnosis, the ARTMAP-IC neural network adds distributed prediction and category instance counting to the basic fuzzy ARTM...
Gail A. Carpenter, Natalya Markuzon
140
Voted
CDC
2009
IEEE
161views Control Systems» more  CDC 2009»
15 years 8 months ago
Consensus on homogeneous manifolds
Abstract— The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external referen...
Alain Sarlette, Rodolphe Sepulchre
CCGRID
2008
IEEE
15 years 5 months ago
Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
Sascha Hunold, Thomas Rauber, Frédér...
145
Voted
MOBIHOC
2008
ACM
16 years 2 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li