Sciweavers

5757 search results - page 950 / 1152
» Dynamic Policy Programming
Sort
View
COR
2006
82views more  COR 2006»
13 years 10 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»
13 years 10 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
DAM
2007
107views more  DAM 2007»
13 years 10 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,...
TOG
2008
200views more  TOG 2008»
13 years 10 months ago
Improved seam carving for video retargeting
Video, like images, should support content aware resizing. We present video retargeting using an improved seam carving operator. Instead of removing 1D seams from 2D images we rem...
Michael Rubinstein, Ariel Shamir, Shai Avidan
TAICPART
2010
IEEE
126views Education» more  TAICPART 2010»
13 years 8 months ago
Improved Testing through Refactoring: Experience from the ProTest Project
We report on how the Wrangler refactoring tool has been used to improve and transform test code for Erlang systems. This has been achieved through the removal of code clones, the i...
Huiqing Li, Simon J. Thompson