Sciweavers

3049 search results - page 549 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
IMR
2003
Springer
14 years 2 months ago
An Adaptable Surface Parameterization Method
Parameterizations of triangulated surfaces are used in an increasing number of mesh processing applications for various purposes. Although demands vary, they are often required to...
Patrick Degener, Jan Meseth, Reinhard Klein
CIKM
2006
Springer
14 years 15 days ago
Incorporating query difference for learning retrieval functions in world wide web search
We discuss information retrieval methods that aim at serving a diverse stream of user queries such as those submitted to commercial search engines. We propose methods that emphasi...
Hongyuan Zha, Zhaohui Zheng, Haoying Fu, Gordon Su...
UAI
2008
13 years 10 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
BMCBI
2006
175views more  BMCBI 2006»
13 years 8 months ago
Parameter estimation for stiff equations of biosystems using radial basis function networks
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...
Yoshiya Matsubara, Shinichi Kikuchi, Masahiro Sugi...
JSAC
2010
138views more  JSAC 2010»
13 years 7 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar