Sciweavers

2374 search results - page 93 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
ATAL
2004
Springer
15 years 3 months ago
Communication for Improving Policy Computation in Distributed POMDPs
Distributed Partially Observable Markov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to joi...
Ranjit Nair, Milind Tambe, Maayan Roth, Makoto Yok...
ICDCSW
2008
IEEE
15 years 4 months ago
Fast-Converging Distance Vector Routing for Wireless Mesh Networks
A major concern about distance-vector routing protocols for wireless mesh networks is its slow convergence in the presence of link changes, which can potentially degrade network s...
Yangcheng Huang, Saleem N. Bhatti
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 4 months ago
Distributed Private Data Analysis: On Simultaneously Solving How and What
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
Amos Beimel, Kobbi Nissim, Eran Omri
ICS
2000
Tsinghua U.
15 years 1 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy
IJCAI
2007
14 years 11 months ago
Kernel Conjugate Gradient for Fast Kernel Machines
We propose a novel variant of the conjugate gradient algorithm, Kernel Conjugate Gradient (KCG), designed to speed up learning for kernel machines with differentiable loss functio...
Nathan D. Ratliff, J. Andrew Bagnell