231 search results - page 38 / 47 » Stochastic Optimization is (Almost) as easy as Deterministic... |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Humans and animals learn much better when the examples are not randomly presented but organized in a meaningful order which illustrates gradually more concepts, and gradually more ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Several theoretical analyses of the dynamics of particle swarms have been offered in the literature over the last decade. Virtually all rely on substantial simplifications, incl...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
SAFECOMP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. To ensure the consistency of database subsystems involved in communication systems (e.g., telephone systems), appropriate scheduled maintenance policies are necessary. Au...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...