4843 search results - page 382 / 969 » The Shortcut Problem - Complexity and Approximation |
132
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
130
click to vote
JAL
2007
15 years 4 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
132
click to vote
TON
2002
15 years 4 months ago
2002
We consider the problem of multirate network design with point-to-multipoint communications. We give a mathematical formulation for this problem. Using approximations, we show that...
157
click to vote
CCE
2010
15 years 2 months ago
2010
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
173
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...