Sciweavers

15485 search results - page 320 / 3097
» Computing Optimal Subsets
Sort
View
HIPEAC
2010
Springer
15 years 8 months ago
Computer Generation of Efficient Software Viterbi Decoders
This paper presents a program generator for fast software Viterbi decoders for arbitrary convolutional codes. The input to the generator is a specification of the code and a single...
Frédéric de Mesmay, Srinivas Chellap...
IJCAI
2003
15 years 8 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
15 years 7 months ago
Modularity and symmetry in computational embryogeny
Modularity and symmetry are two properties observed in almost every engineering and biological structure. The origin of these properties in nature is still unknown. Yet, as engine...
Or Yogev, Andrew A. Shapiro, Erik K. Antonsson
CORR
2002
Springer
78views Education» more  CORR 2002»
15 years 6 months ago
Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
INFOCOM
2010
IEEE
15 years 4 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller