515 search results - page 97 / 103 » Approximating Markov Processes by Averaging |
EOR
2006
14 years 11 months ago
2006
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...
117
click to vote
TIT
2008
14 years 11 months ago
2008
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...
125
click to vote
EMNLP
2009
14 years 9 months ago
2009
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, ...
104
click to vote
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
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...
108
click to vote
VRST
2003
ACM
15 years 5 months ago
2003
ACM
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...