466 search results - page 81 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
Coalition structure generation (CSG) for multi-agent systems is a well-studied problem. A vast majority of the previous work and the state-of-the-art approaches to CSG assume a ch...
102
click to vote
POPL
2011
ACM
14 years 10 days ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
PODS
2003
ACM
15 years 9 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
132
click to vote
ICML
2006
IEEE
15 years 6 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
DAGM
2007
Springer
15 years 3 months ago
2007
Springer
We present an approach for estimating the 3D position and in case of articulated objects also the joint configuration from segmented 2D images. The pose estimation without initial...