1952 search results - page 219 / 391 » Complete partitions of graphs |
173
click to vote
JSSPP
2010
Springer
15 years 4 months ago
2010
Springer
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
127
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
177
click to vote
ICTAI
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning ...
158
click to vote
CIE
2007
Springer
16 years 22 days ago
2007
Springer
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...
140
click to vote
CPAIOR
2004
Springer
15 years 12 months ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...