Sciweavers

242 search results - page 4 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
ICASSP
2009
IEEE
15 years 8 months ago
Modelling the prepausal lengthening effect for speech recognition: a dynamic Bayesian network approach
Speech has a property that the speech unit preceding a speech pause tends to lengthen. This work presents the use of a dynamic Bayesian network to model the prepausal lengthening ...
Ning Ma, Chris Bartels, Jeff A. Bilmes, Phil Green
ICML
2004
IEEE
16 years 1 months ago
Learning random walk models for inducing word dependency distributions
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
Kristina Toutanova, Christopher D. Manning, Andrew...
IPPS
2005
IEEE
15 years 6 months ago
Dynamic Task Scheduling using Genetic Algorithms for Heterogeneous Distributed Computing
An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dyna...
Andrew J. Page, Thomas J. Naughton
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 4 months ago
Analyzing Walksat on random formulas
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
Amin Coja-Oghlan, Alan M. Frieze
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
15 years 6 months ago
Dynamic optimization of migration topology in internet-based distributed genetic algorithms
Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a maj...
Johan Berntsson, Maolin Tang