1160 search results - page 95 / 232 » Dynamic Programming Algorithm for Training Functional Networ... |
128
Voted
INFORMS
1998
15 years 2 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
101
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
139
click to vote
BMCBI
2006
15 years 2 months ago
2006
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
137
click to vote
IJCAI
2007
15 years 3 months ago
2007
Dynamic programming algorithms provide a basic tool identifying optimal solutions in Markov Decision Processes (MDP). The paper develops a representation for decision diagrams sui...
123
click to vote
ICRA
2008
IEEE
15 years 9 months ago
2008
IEEE
— This paper proposes and experimentally validates a Bayesian network model of a range finder adapted to dynamic environments. The modeling rigorously explains all model assumpt...