618 search results - page 3 / 124 » Reducibility and TT-Lifting for Computation Types |
SAS
1994
Springer
13 years 9 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
ICRA
2005
IEEE
13 years 11 months ago
2005
IEEE
— We explore the use of computational optimal control techniques for automated construction of policies in complex dynamic environments. Our implementation of dynamic programming...
JSAC
1998
13 years 5 months ago
1998
Abstract—The excellent bit error rate performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding p...
LCN
2008
IEEE
13 years 11 months ago
2008
IEEE
—In this paper we address the problem of traffic grooming in WDM rings with all-to-all and its generalization to many-to-many service by using network coding. We consider minimi...
HPDC
2010
IEEE
13 years 6 months ago
2010
IEEE
MapReduce offers a flexible programming model for processing and generating large data sets on dedicated resources, where only a small fraction of such resources are every unavaila...