447 search results - page 45 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
137
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
145
Voted
AAAI
2008
15 years 6 months ago
2008
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
129
Voted
IANDC
2006
15 years 3 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
104
click to vote
ICCAD
2006
IEEE
16 years 16 days ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
160
Voted
CDC
2010
IEEE
14 years 10 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...