1033 search results - page 174 / 207 » The Relative History Heuristic |
JASIS
2008
14 years 11 months ago
2008
Gatekeeping theories have been a popular heuristic for describing information control for years, but none have attained a full theoretical status in the context of networks. This ...
INFORMATICALT
2006
14 years 11 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
106
click to vote
ECCC
2007
14 years 11 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
TIT
2008
14 years 11 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 ...
117
click to vote
TON
2008
14 years 11 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...