Sciweavers

172 search results - page 17 / 35
» Efficiency improvement in an nD systems approach to polynomi...
Sort
View
ATAL
2010
Springer
14 years 9 months ago
PAC-MDP learning with knowledge-based admissible models
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
Marek Grzes, Daniel Kudenko
AAAI
2010
14 years 11 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
IPPS
2006
IEEE
15 years 3 months ago
Techniques and tools for dynamic optimization
Traditional code optimizers have produced significant performance improvements over the past forty years. While promising avenues of research still exist, traditional static and p...
Jason Hiser, Naveen Kumar, Min Zhao, Shukang Zhou,...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 3 months ago
Learning noise
In this paper we propose a genetic programming approach to learning stochastic models with unsymmetrical noise distributions. Most learning algorithms try to learn from noisy data...
Michael D. Schmidt, Hod Lipson
ACCV
2009
Springer
15 years 1 months ago
People Tracking and Segmentation Using Efficient Shape Sequences Matching
Abstract. We design an effective shape prior embedded human silhouettes extraction algorithm. Human silhouette extraction is found challenging because of articulated structures, po...
Junqiu Wang, Yasushi Yagi, Yasushi Makihara