Sciweavers

125 search results - page 22 / 25
» Adaptation of Parameters of BP Algorithm Using Learning Auto...
Sort
View
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 9 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
126
Voted
WWW
2010
ACM
15 years 4 months ago
Factorizing personalized Markov chains for next-basket recommendation
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
Steffen Rendle, Christoph Freudenthaler, Lars Schm...
CGO
2005
IEEE
15 years 3 months ago
Optimizing Sorting with Genetic Algorithms
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...
Xiaoming Li, María Jesús Garzar&aacu...
EOR
2008
111views more  EOR 2008»
14 years 9 months ago
Machine-part cell formation in group technology using a modified ART1 method
Group Technology (GT) is a useful way of increasing the productivity for manufacturing high quality products and improving the flexibility of manufacturing systems. Cell formation...
Miin-Shen Yang, Jenn-Hwai Yang
NIPS
1998
14 years 10 months ago
Risk Sensitive Reinforcement Learning
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
Ralph Neuneier, Oliver Mihatsch