Sciweavers

515 search results - page 97 / 103
» Approximating Markov Processes by Averaging
Sort
View
EOR
2006
107views more  EOR 2006»
13 years 7 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
TIT
2008
141views more  TIT 2008»
13 years 7 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
EMNLP
2009
13 years 5 months ago
Graphical Models over Multiple Strings
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
Markus Dreyer, Jason Eisner
PLDI
2003
ACM
14 years 19 days ago
Meta optimization: improving compiler heuristics with machine learning
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
Mark Stephenson, Saman P. Amarasinghe, Martin C. M...
VRST
2003
ACM
14 years 19 days ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann