From post

Learning Probability Densities of Optimization Problems with Constraints and Uncertainty.

, , и . MICAI, том 5317 из Lecture Notes in Computer Science, стр. 266-272. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Filtering by Sparsely Connected Networks Under the Presence of Strong Additive Noise.. ENC, стр. 19-26. IEEE Computer Society, (2006)Introducing Simulated Annealing in Partial Order Planning., , и . MICAI (Special Sessions), стр. 190-196. IEEE Computer Society, (2014)A hybrid heuristic algorithm based on Mean-Field Theory with a Simple Local Search for the Quadratic Knapsack Problem., , и . CEC, стр. 2559-2565. IEEE, (2017)An estimation of distribution algorithm with adaptive Gibbs sampling for unconstrained global optimization, , , , , , , и . CoRR, (2011)De gustibus disputandum (forecasting opinions by knowledge networks), , и . Physica A: Statistical Mechanics and its Applications, (01.02.2004)Cellular Automaton Model of a Wastewater Treatment Process., , , , и . J. Cell. Autom., 13 (5-6): 407-428 (2018)Generating Random Deviates Consistent with the Long Term Behavior of Stochastic Search Processes in Global Optimization.. IWANN, том 4507 из Lecture Notes in Computer Science, стр. 1-7. Springer, (2007)Characterization of the convergence of stationary Fokker-Planck learning. CoRR, (2008)Practice Summary: Enhancing Forecasting and Capacity Planning Capabilities in a Telecommunications Company., , , , и . Interfaces, 43 (4): 385-387 (2013)Stationary Density of Stochastic Search Processes., , и . Encyclopedia of Artificial Intelligence, IGI Global, (2009)