This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
Abstract. Using a recent idea of Gaudry and exploiting rational representations of algebraic tori, we present an index calculus type algorithm for solving the discrete logarithm pr...
The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specifica...
Marko Smiljanic, Maurice van Keulen, Willem Jonker
Abstract. Classical planning domain representations assume all the objects from one type are exactly the same. But when solving problems in the real world systems, the execution of...