Sciweavers

519 search results - page 27 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
NIPS
2003
15 years 2 months ago
Image Reconstruction by Linear Programming
— One way of image denoising is to project a noisy image to the subspace of admissible images derived, for instance by PCA. However, a major drawback of this method is that all p...
Koji Tsuda, Gunnar Rätsch
ICALP
2005
Springer
15 years 7 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
AMAI
2006
Springer
15 years 1 months ago
Symmetric approximate linear programming for factored MDPs with application to constrained problems
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
Dmitri A. Dolgov, Edmund H. Durfee
CPAIOR
2006
Springer
15 years 5 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
ITC
1999
IEEE
107views Hardware» more  ITC 1999»
15 years 5 months ago
A high-level BIST synthesis method based on a region-wise heuristic for an integer linear programming
A high-level built-in self-test (BIST) synthesis involves several tasks such as system register assignment, interconnection assignment, and BIST register assignment. Existing high...
Han Bin Kim, Dong Sam Ha