Sciweavers

1074 search results - page 9 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
AHSWN
2006
148views more  AHSWN 2006»
14 years 9 months ago
Geometric Chemotaxis: A Biologically-Inspired Framework for a Class of Wireless Coverage Problems
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
Hidayet Ozgur Sanli, Rahul Simha, Bhagirath Naraha...
74
Voted
IPPS
2007
IEEE
15 years 3 months ago
Applying IC-Scheduling Theory to Familiar Classes of Computations
Earlier work has developed the underpinnings of IC-Scheduling Theory, an algorithmic framework for scheduling computations having intertask dependencies for Internet-based computi...
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Ros...
CDC
2008
IEEE
123views Control Systems» more  CDC 2008»
15 years 4 months ago
On distributed averaging algorithms and quantization effects
—We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unqua...
Angelia Nedic, Alexander Olshevsky, Asuman E. Ozda...
90
Voted
CDC
2009
IEEE
191views Control Systems» more  CDC 2009»
15 years 2 months ago
Convergence and stability of a distributed CSMA algorithm for maximal network throughput
—Designing efficient scheduling algorithms is an important problem in a general class of networks with resourcesharing constraints, such as wireless networks and stochastic proc...
Libin Jiang, Jean C. Walrand
DMIN
2007
186views Data Mining» more  DMIN 2007»
14 years 11 months ago
Cost-Sensitive Learning vs. Sampling: Which is Best for Handling Unbalanced Classes with Unequal Error Costs?
- The classifier built from a data set with a highly skewed class distribution generally predicts the more frequently occurring classes much more often than the infrequently occurr...
Gary M. Weiss, Kate McCarthy, Bibi Zabar