Sciweavers

4670 search results - page 143 / 934
» Testing that distributions are close
Sort
View
TROB
2008
118views more  TROB 2008»
15 years 6 months ago
Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots
Abstract-- A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Specifically, each agent is assigned with a control law which is the sum ...
Dimos V. Dimarogonas, Kostas J. Kyriakopoulos
CCR
2004
62views more  CCR 2004»
15 years 6 months ago
Summary-based routing for content-based event distribution networks
Providing scalable distributed Web-based eventing services has been an important research topic. It is desirable to have an effective mechanism for the servers to summarize their f...
Yi-Min Wang, Lili Qiu, Chad Verbowski, Dimitris Ac...
JISE
2002
165views more  JISE 2002»
15 years 6 months ago
Locality-Preserving Dynamic Load Balancing for Data-Parallel Applications on Distributed-Memory Multiprocessors
Load balancing and data locality are the two most important factors in the performance of parallel programs on distributed-memory multiprocessors. A good balancing scheme should e...
Pangfeng Liu, Jan-Jan Wu, Chih-Hsuae Yang
TNN
1998
111views more  TNN 1998»
15 years 6 months ago
Asymptotic distributions associated to Oja's learning equation for neural networks
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
Jean Pierre Delmas, Jean-Francois Cardos
TKDE
2002
123views more  TKDE 2002»
15 years 6 months ago
Coordinated Placement and Replacement for Large-Scale Distributed Caches
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions...
Madhukar R. Korupolu, Michael Dahlin