1722 search results - page 89 / 345 » Variables in Concept Graphs |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
JAIR
2000
14 years 9 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
MOR
2010
14 years 8 months ago
2010
We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several m...
ICLP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. This paper proposes a diagnosis algorithm for locating a certain kind of errors in logic programs: variable binding errors that result act symptoms during compile-time ch...