5314 search results - page 695 / 1063 » Hybrid Dynamic Programming |
144
click to vote
EOR
2006
15 years 6 months ago
2006
This paper is concerned with workload minimization in re-entrant lines with exponential service times and preemptive control policies. Using a numerical algorithm called the power...
165
click to vote
JBI
2006
15 years 6 months ago
2006
Bioinformatics is a dynamic research area in which a large number of algorithms and programs have been developed rapidly and independently without much consideration so far of the...
173
click to vote
IPL
2007
15 years 6 months ago
2007
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
160
click to vote
TCS
2008
15 years 6 months ago
2008
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
170
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...