13376 search results - page 2422 / 2676 » Problem Solving with |
157
click to vote
LICS
2010
IEEE
15 years 2 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
200
click to vote
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
145
click to vote
WABI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...
139
click to vote
CP
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
150
click to vote
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper, we introduce a method to estimate the object's pose from multiple video cameras. We derive a centralized solution to pose estimation from multiple video camera...