Sciweavers

5606 search results - page 566 / 1122
» Randomization Techniques for Graphs.
Sort
View
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
16 years 19 days ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
IPSN
2004
Springer
16 years 16 days ago
Naps: scalable, robust topology management in wireless ad hoc networks
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
Brighten Godfrey, David Ratajczak
CSB
2002
IEEE
169views Bioinformatics» more  CSB 2002»
16 years 4 days ago
Bayesian Network and Nonparametric Heteroscedastic Regression for Nonlinear Modeling of Genetic Network
We propose a new statistical method for constructing a genetic network from microarray gene expression data by using a Bayesian network. An essential point of Bayesian network con...
Seiya Imoto, SunYong Kim, Takao Goto, Sachiyo Abur...
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
15 years 12 months ago
Quantized consensus via adaptive stochastic gossip algorithm
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
Javad Lavaei, Richard M. Murray
ICALP
2001
Springer
15 years 11 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan