Sciweavers

1494 search results - page 235 / 299
» Polynomial time algorithms for network information flow
Sort
View
SBACPAD
2003
IEEE
138views Hardware» more  SBACPAD 2003»
14 years 2 months ago
Finite Difference Simulations of the Navier-Stokes Equations Using Parallel Distributed Computing
 This paper discusses the implementation of a numerical algorithm for simulating incompressible fluid flows based on the finite difference method and designed for parallel compu...
João Paulo De Angeli, Andréa M. P. V...
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
14 years 1 months ago
Distributed coverage games for mobile visual sensors (II) : Reaching the set of global optima
— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...
Minghui Zhu, Sonia Martínez
CDC
2009
IEEE
178views Control Systems» more  CDC 2009»
14 years 1 months ago
Distributed coverage games for mobile visual sensors (I): Reaching the set of Nash equilibria
— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...
Minghui Zhu, Sonia Martínez
ISPA
2005
Springer
14 years 2 months ago
Online Adaptive Fault-Tolerant Routing in 2D Torus
In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty...
Yamin Li, Shietung Peng, Wanming Chu
DBKDA
2009
IEEE
99views Database» more  DBKDA 2009»
14 years 19 days ago
An Adaptive Synchronization Policy for Harvesting OAI-PMH Repositories
Metadata harvesting requires timely propagation of up-to-date information from thousands of Repositories over a wide area network. It is desirable to keep the data as fresh as poss...
Noha Adly