1197 search results - page 88 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
139
click to vote
COLING
1992
15 years 6 months ago
1992
Parsing a long sentence is very difficult, since long sentences often have conjunctions which result in ambiguities. If the conjunctive structures existing in a long sentence can ...
139
click to vote
AAAI
2007
15 years 8 months ago
2007
In this paper, a state-based approach for the Constraint Satisfaction Problem (CSP) is proposed. The key novelty is an original use of state memorization during search to prevent ...
155
click to vote
AAECC
1999
Springer
15 years 5 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
178
click to vote
IJCV
2006
15 years 5 months ago
2006
We present an algebraic geometric approach to 3-D motion estimation and segmentation of multiple rigid-body motions from noise-free point correspondences in two perspective views. ...
148
click to vote
TCS
2008
15 years 5 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...