3055 search results - page 426 / 611 » Randomized Search Trees |
148
click to vote
COMPSAC
2002
IEEE
15 years 9 months ago
2002
IEEE
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
126
click to vote
ICRA
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper we present a new probabilistic feature-based approach to multi-hypothesis global localization and pose tracking. Hypotheses are generated using a constraintbased sea...
139
click to vote
CPAIOR
2010
Springer
15 years 9 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
127
click to vote
ECML
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. In a multiple-instance representation, each learning example is r...
142
click to vote
WABI
2001
Springer
15 years 8 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...