Sciweavers

709 search results - page 138 / 142
» On LR(k)-Parsers of Polynomial Size
Sort
View
74
Voted
COR
2006
82views more  COR 2006»
14 years 9 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,...
CSDA
2006
90views more  CSDA 2006»
14 years 9 months ago
Estimation in covariate-adjusted regression
Abstract: The method of covariate adjusted regression was recently proposed for situations where both predictors and response in a regression model are not directly observed, but a...
Damla Sentürk, Danh V. Nguyen
DAM
2007
177views more  DAM 2007»
14 years 9 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
PC
2008
123views Management» more  PC 2008»
14 years 9 months ago
The impact of heterogeneity on master-slave scheduling
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...
Jean-Francois Pineau, Yves Robert, Fréd&eac...
84
Voted
TIT
2008
83views more  TIT 2008»
14 years 9 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck