3600 search results - page 519 / 720 » The settling-time reducibility ordering |
181
click to vote
IJCAI
1993
15 years 8 months ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
180
click to vote
ISMB
1996
15 years 8 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
183
click to vote
ISMB
1994
15 years 8 months ago
1994
Wepresent algorithms for kinematic manipulation of molecular chains subject to fixed bond lengths and bond angles. They are useful for calculating conformations of a molecule subj...
191
click to vote
MVA
1996
15 years 8 months ago
1996
automatically updated during the matching process, This paper describes a real-time tracking system which detects an object entering into the field of view of camera and executes t...
167
click to vote
IJCAI
1989
15 years 7 months ago
1989
In many applications in mobile robotics, it is important for a robot to explore its environment in order to construct a representation of space useful for guiding movement. We refe...