2370 search results - page 38 / 474 » A Structured Set of Higher-Order Problems |
ARSCOM
2007
13 years 9 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
ASP
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
FROCOS
2009
Springer
14 years 3 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
ICPR
2010
IEEE
14 years 13 days ago
2010
IEEE
—The problem we address in the paper is how to learn a joint representation from data lying on multiple manifolds. We are given multiple data sets and there is an underlying comm...
LPNMR
2004
Springer
14 years 2 months ago
2004
Springer
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...