Sciweavers

4843 search results - page 846 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
104
Voted
FLAIRS
2008
15 years 16 days ago
State Space Compression with Predictive Representations
Current studies have demonstrated that the representational power of predictive state representations (PSRs) is at least equal to the one of partially observable Markov decision p...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...
WSC
2007
15 years 16 days ago
American option pricing under stochastic volatility: a simulation-based approach
We consider the problem of pricing American options when the volatility of the underlying asset price is stochastic. No specific stochastic volatility model is assumed for the st...
Arunachalam Chockalingam, Kumar Muthuraman
WSC
2008
15 years 16 days ago
How to build valid and credible simulation models
In this tutorial we present techniques for building valid and credible simulation models. Ideas to be discussed include the importance of a definitive problem formulation, discuss...
Averill M. Law
ANCS
2008
ACM
15 years 7 days ago
Performing time-sensitive network experiments
Time-sensitive network experiments are difficult. There are major challenges involved in generating high volumes of sufficiently realistic traffic. Additionally, accurately measur...
Neda Beheshti, Yashar Ganjali, Monia Ghobadi, Nick...
ANNPR
2008
Springer
15 years 7 days ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi