Sciweavers

8413 search results - page 529 / 1683
» Ordering Problem Subgoals
Sort
View
TCS
2008
15 years 6 months ago
Scheduling to maximize participation
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
JACM
2007
79views more  JACM 2007»
15 years 6 months ago
A new look at survey propagation and its generalizations
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...
Elitza N. Maneva, Elchanan Mossel, Martin J. Wainw...
TNN
2008
128views more  TNN 2008»
15 years 6 months ago
A Hybrid Technique for Blind Separation of Non-Gaussian and Time-Correlated Sources Using a Multicomponent Approach
Blind inversion of a linear and instantaneous mixture of source signals is a problem often encountered in many signal processing applications. Efficient FastICA (EFICA) offers an ...
Petr Tichavský, Zbynek Koldovský, Ar...
TNN
2008
138views more  TNN 2008»
15 years 6 months ago
A Fast and Scalable Recurrent Neural Network Based on Stochastic Meta Descent
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
Zhenzhen Liu, Itamar Elhanany
IPL
2002
65views more  IPL 2002»
15 years 6 months ago
Parallel evolutionary algorithms can achieve super-linear performance
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
Enrique Alba