Sciweavers

648 search results - page 55 / 130
» Using Criticalities as a Heuristic for Answer Set Programmin...
Sort
View
TDSC
2010
119views more  TDSC 2010»
14 years 8 months ago
On the General Applicability of Instruction-Set Randomization
We describe Instruction-Set Randomization (ISR), a general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoffs' principle to creat...
Stephen W. Boyd, Gaurav S. Kc, Michael E. Locasto,...
DAC
2009
ACM
16 years 2 months ago
WCET-aware register allocation based on graph coloring
Current compilers lack precise timing models guiding their built-in optimizations. Hence, compilers apply ad-hoc heuristics during optimization to improve code quality. One of the...
Heiko Falk
CASES
2010
ACM
14 years 11 months ago
Improved procedure placement for set associative caches
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
Yun Liang, Tulika Mitra
CP
2009
Springer
15 years 8 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan
ISDA
2009
IEEE
15 years 8 months ago
MAHATMA: A Genetic Programming-Based Tool for Protein Classification
Proteins can be grouped into families according to some features such as hydrophobicity, composition or structure, aiming to establish common biological functions. This paper pres...
Denise Fukumi Tsunoda, Alex Alves Freitas, Heitor ...