1940 search results - page 149 / 388 » Graph Transformation with Variables |
147
click to vote
CORR
2010
Springer
15 years 6 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...
154
click to vote
JAIR
2000
15 years 6 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...
159
click to vote
MOR
2010
15 years 4 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...
155
click to vote
ICLP
2007
Springer
16 years 16 days 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...
147
click to vote
CSCLP
2005
Springer
15 years 12 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...