Sciweavers

10988 search results - page 1989 / 2198
» Algorithmic Folding Complexity
Sort
View
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
14 years 10 months ago
Pathologies of temporal difference methods in approximate dynamic programming
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...
Dimitri P. Bertsekas
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
14 years 10 months ago
Asymmetric information diffusion via gossiping on static and dynamic networks
In this paper we consider the problem of gossiping in a network to diffuse the average of a sub-set of nodes, called sources, and directing it to another sub-set of nodes in the ne...
Mehmet Ercan Yildiz, Anna Scaglione, Asuman E. Ozd...
136
Voted
CORR
2011
Springer
191views Education» more  CORR 2011»
14 years 10 months ago
A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
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...
Philip Schniter
164
Voted
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 10 months ago
Analysis of multi-stage open shop processing systems
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...
Christian Eggermont, Alexander Schrijver, Gerhard ...
COLING
2010
14 years 10 months ago
Efficient Statement Identification for Automatic Market Forecasting
Strategic business decision making involves the analysis of market forecasts. Today, the identification and aggregation of relevant market statements is done by human experts, oft...
Henning Wachsmuth, Peter Prettenhofer, Benno Stein
« Prev « First page 1989 / 2198 Last » Next »