1033 search results - page 148 / 207 » The Relative History Heuristic |
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
110
click to vote
SARA
2009
Springer
15 years 6 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
104
click to vote
CGO
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper proposes the use of empirical modeling techniques for building microarchitecture sensitive models for compiler optimizations. The models we build relate program perform...
102
click to vote
LCTRTS
2007
Springer
15 years 6 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
DFT
2006
IEEE
15 years 6 months ago
2006
IEEE
1 High temperature has become a major problem for system-on-chip testing. In order to reduce the test time while keeping the temperature of the chip under test within a safe range,...