Sciweavers

1749 search results - page 166 / 350
» Logic, Optimization, and Constraint Programming
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 3 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
CISS
2008
IEEE
15 years 9 months ago
A linear integer programming approach to analyze P2P media streaming
Recent advancement in peer-to-peer (P2P) technologies has enabled a wide range of new applications. In this paper, we present mixed integer programming (MIP) formulations to analy...
Fulu Li, Jianwei Huang, Andrew Lippman
EMNLP
2008
15 years 4 months ago
Attacking Decipherment Problems Optimally with Low-Order N-gram Models
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
Sujith Ravi, Kevin Knight
TSP
2010
14 years 9 months ago
A Doppler robust max-min approach to radar code design
Abstract--This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort...
Antonio De Maio, Yongwei Huang, Marco Piezzo
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
15 years 10 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...