Sciweavers

158 search results - page 5 / 32
» Distributed solving through model splitting
Sort
View
ISM
2006
IEEE
113views Multimedia» more  ISM 2006»
14 years 3 months ago
Individualization and Flexibility through Computer Algebra Systems in Virtual Laboratories
Virtual labs enable field specific experiments and open them for collaborative and distributed usage. In order to realize comprehensive laboratory set-ups providing a scientifi...
Sabina Jeschke, Thomas Richter
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 9 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
CORR
2011
Springer
204views Education» more  CORR 2011»
13 years 4 months ago
Accelerated Dual Descent for Network Optimization
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
Michael Zargham, A. Ribeiro, Ali Jadbabaie, Asuman...
GLVLSI
2005
IEEE
118views VLSI» more  GLVLSI 2005»
14 years 3 months ago
A continuous time markov decision process based on-chip buffer allocation methodology
We have presented an optimal on-chip buffer allocation and buffer insertion methodology which uses stochastic models of the architecture. This methodology uses finite buffer s...
Sankalp Kallakuri, Nattawut Thepayasuwan, Alex Dob...
ICDCN
2011
Springer
13 years 1 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...