1844 search results - page 80 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
150
click to vote
CVPR
2012
IEEE
13 years 1 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
102
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an expressive framework for multiagent planning under uncertainty, but solving them is provabl...
107
click to vote
SODA
2004
ACM
15 years 20 days ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
118
click to vote
IPCO
2008
15 years 22 days ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...