2430 search results - page 287 / 486 » Computing Tutte Polynomials |
126
click to vote
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...
150
click to vote
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
130
click to vote
CPAIOR
2009
Springer
15 years 10 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
134
Voted
ECSQARU
2009
Springer
15 years 10 months ago
2009
Springer
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
102
click to vote
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
Let A be a randomized, unlimited supply, unit demand, single-item auction, which given a bid-vector b ∈ [h]n , has expected profit E[P(b)]. Aggarwal et al. showed that given A, ...