Data adaptation is an essential system component in a wide variety of application areas. To date, most applications use ad hoc methods to manage data in response to limited resour...
In this paper a new method is described for move ordering, called the relative history heuristic. It is a combination of the history heuristic and the butterfly heuristic. Instead...
Mark H. M. Winands, Erik C. D. van der Werf, H. Ja...
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Abstract. This paper introduces a new method to determine appealing placements of textual annotations for complex-shaped geometric models. It employs dynamic potential fields, whi...
In implementing cryptographic algorithms on limited devices such as smart cards, speed and memory optimization had always been a challenge. With the advent of side channel attacks,...