Sciweavers

154 search results - page 3 / 31
» Approximated Consistency for Knapsack Constraints
Sort
View
DCC
2002
IEEE
14 years 7 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
CSCLP
2003
Springer
14 years 20 days ago
Learning Approximate Consistencies
ing Soft Constraints: Some Experimental Results on Fuzzy CSPs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 Stefano Bi...
Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh ...
SPLC
2008
13 years 8 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
UAI
2000
13 years 8 months ago
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...
Michael C. Horsch, William S. Havens
CAD
2004
Springer
13 years 7 months ago
Choosing consistent constraints for beautification of reverse engineered geometric models
Boundary representation models reconstructed from 3D range data suffer from various inaccuracies caused by noise in the data and the model building software. Such models can be im...
Frank C. Langbein, A. David Marshall, Ralph R. Mar...