68 search results - page 2 / 14 » A Reach and Bound algorithm for acyclic dynamic-programming ... |
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
ORL
2006
13 years 4 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
WEA
2007
Springer
13 years 11 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
ISMB
1993
13 years 6 months ago
1993
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
NIPS
1998
13 years 6 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...