Sciweavers

4843 search results - page 439 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
145
Voted
EMNLP
2006
15 years 6 months ago
Random Indexing using Statistical Weight Functions
Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Inde...
James Gorman, James R. Curran
136
Voted
ESANN
2006
15 years 6 months ago
Reducing policy degradation in neuro-dynamic programming
We focus on neuro-dynamic programming methods to learn state-action value functions and outline some of the inherent problems to be faced, when performing reinforcement learning in...
Thomas Gabel, Martin Riedmiller
151
Voted
NIPS
2001
15 years 6 months ago
The Unified Propagation and Scaling Algorithm
In this paper we will show that a restricted class of constrained minimum divergence problems, named generalized inference problems, can be solved by approximating the KL divergen...
Yee Whye Teh, Max Welling
JFPLC
2003
15 years 6 months ago
Une approche hybride pour l'optimisation multi-objectif sous contraintes
ABSTRACT. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary c...
Vincent Barichard, Jin-Kao Hao
142
Voted
AAAI
1997
15 years 6 months ago
Summarizing CSP Hardness with Continuous Probability Distributions
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
Daniel Frost, Irina Rish, Lluís Vila