466 search results - page 42 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
141
click to vote
IBPRIA
2007
Springer
16 years 6 days ago
2007
Springer
Image preprocessing stage (also known as iris segmentation) is the first step of the iris recognition process and determines its accuracy. In this paper, we propose a method for ir...
170
click to vote
AAAI
2010
15 years 7 months ago
2010
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
187
click to vote
AGP
1995
IEEE
15 years 9 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
196
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
149
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...