725 search results - page 23 / 145 » Smoothed Analysis of Algorithms and Heuristics |
WSC
1998
14 years 11 months ago
1998
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
BMCBI
2010
14 years 10 months ago
2010
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
JDWM
2007
14 years 9 months ago
2007
Rule induction from examples is a machine learning technique that finds rules of the form condition → class, where condition and class are logic expressions of the form variable...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...