Sciweavers

2930 search results - page 411 / 586
» The optimal sequence compression
Sort
View
ATMOS
2007
177views Optimization» more  ATMOS 2007»
15 years 8 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
HYBRID
2010
Springer
16 years 1 months ago
Real-time scheduling of mixture-of-experts systems with limited resources
Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the “experts”). Given an instance of a...
Prapaporn Rattanatamrong, José A. B. Fortes
CASES
2007
ACM
15 years 10 months ago
Stack size reduction of recursive programs
For memory constrained environments like embedded systems, optimization for program size is often as important, if not more important, as optimization for execution speed. Commonl...
Stefan Schäckeler, Weijia Shang
TIT
2008
141views more  TIT 2008»
15 years 6 months ago
Dimensionality Reduction for Distributed Estimation in the Infinite Dimensional Regime
Distributed estimation of an unknown signal is a common task in sensor networks. The scenario usually envisioned consists of several nodes, each making an observation correlated wi...
Olivier Roy, Martin Vetterli
JCP
2007
118views more  JCP 2007»
15 years 6 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci