Sciweavers

654 search results - page 127 / 131
» Ordered Sets and Complete Lattices
Sort
View
IOR
2008
128views more  IOR 2008»
13 years 7 months ago
Promised Lead-Time Contracts Under Asymmetric Information
We study the important problem of how a supplier should optimally share the consequences of demand uncertainty (i.e., the cost of inventory excesses and shortages) with a retailer...
Holly Lutze, Özalp Özer
JOC
2006
69views more  JOC 2006»
13 years 7 months ago
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
Jonathan Katz, Moti Yung
TASE
2008
IEEE
13 years 7 months ago
New Hybrid Optimization Algorithms for Machine Scheduling Problems
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
Yunpeng Pan, Leyuan Shi
TIP
2008
153views more  TIP 2008»
13 years 7 months ago
Generalized Flooding and Multicue PDE-Based Image Segmentation
Image segmentation remains an important, but hard-to-solve, problem since it appears to be application dependent with usually no a priori information available regarding the image ...
Anastasia Sofou, Petros Maragos
COCOA
2010
Springer
13 years 5 months ago
Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...
Peter Damaschke, Azam Sheikh Muhammad