2412 search results - page 14 / 483 » Which Problems Have Strongly Exponential Complexity |
EOR
2008
15 years 21 days ago
2008
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for representing continuous chance variables in influence diagrams. Also, MTE potentials c...
116
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
102
Voted
DISOPT
2007
15 years 18 days ago
2007
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
80
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
118
Voted
CSFW
2009
IEEE
15 years 4 months ago
2009
IEEE
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...