Sciweavers

38 search results - page 1 / 8
» The Backdoor Key: A Path to Understanding Problem Hardness
Sort
View
AAAI
2004
13 years 6 months ago
The Backdoor Key: A Path to Understanding Problem Hardness
Yongshao Ruan, Henry A. Kautz, Eric Horvitz
SODA
2012
ACM
226views Algorithms» more  SODA 2012»
11 years 7 months ago
On the hardness of pricing loss-leaders
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
Preyas Popat, Yi Wu
AAAI
2006
13 years 6 months ago
The Impact of Balancing on Problem Hardness in a Highly Structured Domain
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
Carlos Ansótegui, Ramón Béjar...
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
13 years 11 months ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu
DIMVA
2008
13 years 6 months ago
VeriKey: A Dynamic Certificate Verification System for Public Key Exchanges
Abstract. This paper presents a novel framework to substantiate selfsigned certificates in the absence of a trusted certificate authority. In particular, we aim to address the prob...
Brett Stone-Gross, David Sigal, Rob Cohn, John Mor...