452 search results - page 48 / 91 » A mean field approach for optimization in discrete time |
NIPS
1993
14 years 11 months ago
1993
Stochastic optimization algorithms typically use learning rate schedules that behave asymptotically as (t) = 0=t. The ensemble dynamics (Leen and Moody, 1993) for such algorithms ...
COR
2008
14 years 9 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
BMCBI
2008
14 years 10 months ago
2008
Background: Protein structure prediction and computational protein design require efficient yet sufficiently accurate descriptions of aqueous solvent. We continue to evaluate the ...
100
click to vote
EUC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Embedded systems have strict timing and code size requirements. Retiming is one of the most important optimization techniques to improve the execution time of loops by in...
JGS
2010
14 years 4 months ago
2010
Despite the fact that it provides a potentially useful analytical tool, allowing for the joint modeling of dynamic interdependencies within a group of connected areas, until latel...