Sciweavers

5314 search results - page 853 / 1063
» Hybrid Dynamic Programming
Sort
View
CL
2010
Springer
15 years 6 months ago
Isolating untrusted software extensions by custom scoping rules
In a modern programming language, scoping rules determine the visibility of names in various regions of a program [15]. In this work, we examine the idea of allowing an applicatio...
Philip W. L. Fong, Simon A. Orr
COR
2006
82views more  COR 2006»
15 years 6 months ago
Batching work and rework processes with limited deterioration of reworkables
We study the problem of planning the production of new and recovering defective items of the same product manufactured on the same facility. Items of the product are produced in b...
Karl Inderfurth, Adam Janiak, Mikhail Y. Kovalyov,...
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 6 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
EOR
2006
199views more  EOR 2006»
15 years 6 months ago
Short-term booking of air cargo space
This paper proposes a stochastic dynamic programming model for a short-term capacity planning model for air cargo space. The long-term cargo space is usually acquired by freight fo...
Ek Peng Chew, Huei Chuen Huang, Ellis L. Johnson, ...
DAM
2007
107views more  DAM 2007»
15 years 6 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...