Sciweavers

3270 search results - page 287 / 654
» Approximate String Processing
Sort
View
124
Voted
GECCO
2006
Springer
196views Optimization» more  GECCO 2006»
15 years 7 months ago
An anticipatory approach to improve XCSF
XCSF is a novel version of learning classifier systems (LCS) which extends the typical concept of LCS by introducing computable classifier prediction. In XCSF Classifier predictio...
Amin Nikanjam, Adel Torkaman Rahmani
130
Voted
AAAI
2006
15 years 5 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
123
Voted
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
15 years 5 months ago
An exact subexponential-time lattice algorithm for Asian options
Asian options are path-dependent derivatives. How to price them efficiently and accurately has been a longstanding research and practical problem. Asian options can be priced on t...
Tian-Shyr Dai, Yuh-Dauh Lyuu
138
Voted
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 3 months ago
A Multilevel Approach For Nonnegative Matrix Factorization
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...
Nicolas Gillis, François Glineur
CORR
2006
Springer
81views Education» more  CORR 2006»
15 years 3 months ago
Universal Filtering via Hidden Markov Modeling
The problem of discrete universal filtering, in which the components of a discrete signal emitted by an unknown source and corrupted by a known discrete memoryless channel (DMC) ar...
Taesup Moon, Tsachy Weissman