Joris Kinable

Learn More
Each day, anti-virus companies receive tens of thousands samples of potentially harmful executables. Many of the malicious samples are variations of previously encountered malware, created by their authors to evade pattern-based detection. Dealing with these large amounts of data requires robust, automatic detection approaches. This paper studies malware(More)
The amount of suspicious binary executables submitted to Anti-Virus (AV) companies are in the order of tens of thousands per day. Current hash-based signature methods are easy to deceive and are inefficient for identifying known malware that have undergone minor changes. Examining malware executables using their call graphs view is a suitable approach for(More)
In cold weather cities, snowstorms can have a significant dis-ruptive effect on both mobility and safety, and consequently the faster that streets can be cleared the better. Yet in most cities, plans for snow-plowing are developed using simple allocation schemes that while easy to implement can also be quite inefficient. In this paper we consider the(More)
This paper presents an exact algorithm for the Lock Scheduling Problem (LSP) based on a Combinatorial Benders decomposition. LSP consists of three strongly interconnected sub problems: scheduling the lockages, assigning ships to chambers, and positioning the ships inside the chambers. These three sub problems are interpreted resp. as a scheduling, an(More)
What can MDDs do for combinatorial optimization? • Compact representation of all solutions to a problem • Limit on size gives approximation • Control strength of approximation by size limit MDDs for integer optimization • MDD relaxations provide upper bounds • MDD restrictions provide lower bounds • New branch‐and‐bound scheme MDDs for constraint‐based(More)