Sciweavers

361 search results - page 6 / 73
» Average Case Analysis of Dynamic Geometric Optimization
Sort
View
ICCS
2003
Springer
14 years 8 days ago
Scaling Molecular Dynamics to 3000 Processors with Projections: A Performance Analysis Case Study
Some of the most challenging applications to parallelize scalably are the ones that present a relatively small amount of computation per iteration. Multiple interacting performance...
Laxmikant V. Kalé, Sameer Kumar, Gengbin Zh...
OPODIS
2008
13 years 8 months ago
Fast Geometric Routing with Concurrent Face Traversal
We present a concurrent face routing CFR algorithm. We formally prove that the worst case latency of our algorithm is asymptotically optimal. Our simulation results demonstrate tha...
Thomas Clouser, Mark Miyashita, Mikhail Nesterenko
IPL
2010
119views more  IPL 2010»
13 years 5 months ago
Note on Max Lin-2 above Average
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...
Robert Crowston, Gregory Gutin, Mark Jones
FORMATS
2008
Springer
13 years 8 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
DCOSS
2011
Springer
12 years 6 months ago
A local average consensus algorithm for wireless sensor networks
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
Konstantin Avrachenkov, Mahmoud El Chamie, Giovann...