4903 search results - page 307 / 981 » The Set Covering Machine |
207
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
169
click to vote
IPL
2008
15 years 6 months ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
198
click to vote
BCB
2010
15 years 1 months ago
2010
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
237
click to vote
JDCTA
2010
15 years 1 months ago
2010
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
298
click to vote
Book
"Artificial Intelligence (AI) is a big field, and this is a big book. We have tried to explore the full breadth of the field, which encompasses logic, probability, and continu...