Sciweavers

1330 search results - page 179 / 266
» No Classic Boundary Conditions
Sort
View
AI
2008
Springer
15 years 6 months ago
Graphically structured value-function compilation
Classical work on eliciting and representing preferences over multi-attribute alternatives has attempted to recognize conditions under which value functions take on particularly s...
Ronen I. Brafman, Carmel Domshlak
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 6 months ago
A constructive and unifying framework for zero-bit watermarking
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in a piece of content. The watermark detector checks ...
Teddy Furon
MP
2006
100views more  MP 2006»
15 years 6 months ago
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalit...
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, ...
TCOM
2008
75views more  TCOM 2008»
15 years 6 months ago
Fast performance estimation of block codes
Importance sampling is used in this paper to address the classical yet important problem of performance estimation of block codes. Simulation distributions that comprise discretean...
Rajan Srinivasan, Nuo Wang
ITA
2007
118views Communications» more  ITA 2007»
15 years 6 months ago
Uniformly bounded duplication codes
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing dupl...
Peter Leupold, Victor Mitrana