3677 search results - page 344 / 736 » Generalized Adaptive A* |
179
click to vote
CSDA
2007
15 years 6 months ago
2007
The Total Least Squares method is generalized in the context of the functional linear model. A smoothing splines estimator of the functional coefficient of the model is first prop...
181
click to vote
NETWORKS
2008
15 years 6 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
170
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
191
click to vote
IJON
1998
15 years 6 months ago
1998
In their paper [1], Tsoi and Tan present what they call a "canonical form", which they claim to be identical to that proposed in Nerrand et al [2]. They also claim that ...
168
click to vote
MSCS
2007
15 years 6 months ago
2007
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...