3758 search results - page 486 / 752 » A Complete Subsumption Algorithm |
151
click to vote
AAAI
1998
15 years 7 months ago
1998
A key assumption of all problem-solving approaches based on utility theory, including heuristic search, is that we can assign a utility or cost to each state. This in turn require...
166
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
170
click to vote
ISMB
1998
15 years 7 months ago
1998
The avMlability of large EST(Expressed Sequence Tag)databases has led to a revolution in the waynew genes are cloned. Difficulties arise, however,due to high error rates and redun...
152
click to vote
AAAI
1996
15 years 7 months ago
1996
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
185
click to vote
ALENEX
2009
15 years 7 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...