1639 search results - page 146 / 328 » Anytime Heuristic Search |
IMC
2003
ACM
14 years 3 months ago
2003
ACM
Internet Service Providers (ISPs) can exploit path diversity to balance load and improve robustness. Unfortunately, it is difficult to evaluate the potential impact of these appr...
HT
1993
ACM
14 years 2 months ago
1993
ACM
Hypertexts may be implicitly structured, based on either node content or context. In this paper, we examine implicit structures that rely on the interpretation of node’s spatial...
AAAI
2010
13 years 11 months ago
2010
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
TIT
2008
13 years 10 months ago
2008
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...
BMCBI
2008
13 years 10 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...