3353 search results - page 335 / 671 » Laver and set theory |
163
click to vote
ATMOS
2010
15 years 5 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
192
click to vote
JACM
2010
15 years 5 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...
195
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
156
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
167
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...