Sciweavers

217 search results - page 1 / 44
» Backdoors To Typical Case Complexity
Sort
View
IJCAI
2003
13 years 5 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 4 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
FROCOS
2007
Springer
13 years 10 months ago
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
Viorica Sofronie-Stokkermans
PDPTA
2010
13 years 2 months ago
A Case Study for SOA System Rejuvenation
- Complex business service systems, such as SOA system, are prone to suffer from reliability problem. Various legend applications compatible in SOA system make things worse. Softwa...
Guanhua Tian, Jianfeng Zhan, Chao Ren, Dan Meng
CODASPY
2012
12 years 7 days ago
Detecting repackaged smartphone applications in third-party android marketplaces
Recent years have witnessed incredible popularity and adoption of smartphones and mobile devices, which is accompanied by large amount and wide variety of feature-rich smartphone ...
Wu Zhou, Yajin Zhou, Xuxian Jiang, Peng Ning