844 search results - page 109 / 169 » Solving the p |
130
click to vote
ICLP
2010
Springer
15 years 9 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
175
click to vote
RCIS
2010
15 years 4 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
178
click to vote
TALG
2010
15 years 19 days ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
142
click to vote
ICCS
2005
Springer
15 years 11 months ago
2005
Springer
Three-dimensional direct numerical simulations are performed of turbulent combustion of initially spherical flame kernels. The chemistry is described by a progress variable which ...
166
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...