3663 search results - page 368 / 733 » Problems in the ontology of computer programs |
128
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We develop a computationally efficient and memory efficient approach to (near) maximum a posteriori probability demodulation for MIMO systems with QPSK signalling, based on semi...
193
click to vote
COREGRID
2007
Springer
16 years 1 months ago
2007
Springer
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
204
click to vote
ICALP
2005
Springer
16 years 10 days ago
2005
Springer
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
169
click to vote
IPPS
2003
IEEE
16 years 3 days ago
2003
IEEE
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional g...
177
click to vote
AAAI
2004
15 years 8 months ago
2004
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...