952 search results - page 96 / 191 » Computational complexity of stochastic programming problems |
259
click to vote
SIGECOM
2011
ACM
14 years 5 months ago
2011
ACM
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
126
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
138
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
124
click to vote
CGI
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents a quasi-physically based approach for interactively simulating large-scale dynamic forest scenes under different wind conditions. We introduce theories from th...
136
click to vote
PPOPP
2005
ACM
15 years 8 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...