Sciweavers

7 search results - page 1 / 2
» Relative Strength of Strategy Elimination Procedures
Sort
View
TARK
2005
Springer
14 years 4 months ago
Order independence and rationalizability
Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of...
Krzysztof R. Apt
JAR
2000
129views more  JAR 2000»
13 years 10 months ago
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. ...
CPAIOR
2008
Springer
14 years 19 days ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
BMCBI
2006
139views more  BMCBI 2006»
13 years 11 months ago
DNA Molecule Classification Using Feature Primitives
Background: We present a novel strategy for classification of DNA molecules using measurements from an alpha-Hemolysin channel detector. The proposed approach provides excellent c...
Raja Tanveer Iqbal, Matthew Landry, Stephen Winter...