16666 search results - page 2998 / 3334 » Descriptive and Computational Complexity |
179
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
190
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
184
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...
219
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
183
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...