1064 search results - page 100 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
160
click to vote
AAAI
2007
15 years 6 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
153
click to vote
SISAP
2009
IEEE
15 years 11 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
120
click to vote
IJCNLP
2004
Springer
15 years 9 months ago
2004
Springer
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...
215
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
153
click to vote
JACM
2010
15 years 2 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...