This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integ...
This paper presents an Integer Linear Programming (ILP) approach to the instruction-set extension identification problem. An algorithm that iteratively generates and solves a set...
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
Jan Weyer-Menkhoff, Claudine Devauchelle, Alexande...
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...