904 search results - page 120 / 181 » Scheduling task graphs optimally with A |
139
Voted
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
148
Voted
JMLR
2006
15 years 3 months ago
2006
We present Variable Influence Structure Analysis, or VISA, an algorithm that performs hierarchical decomposition of factored Markov decision processes. VISA uses a dynamic Bayesia...
137
Voted
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
129
click to vote
IPMI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We propose a novel algorithm called graph-shifts for performing image segmentation and labeling. This algorithm makes use of a dynamic hierarchical representation of the ...
130
click to vote
IJHPCA
2006
15 years 3 months ago
2006
The purpose of GridSolve is to create the middleware necessary to provide a seamless bridge between the simple, standard programming interfaces and desktop systems that dominate t...