589 search results - page 74 / 118 » Local Search Algorithms for SAT: An Empirical Evaluation |
PODS
2005
ACM
15 years 12 months ago
2005
ACM
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
101
click to vote
IJCAI
2003
15 years 1 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
ATAL
2010
Springer
15 years 28 days ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we study the following problem: given two source images A and A , and a target image B, can we learn to synthesize a new image B which relates to B in the same way t...