The performance skeleton of an application is a short running program whose performance in any scenario reflects the performance of the application it represents. Specifically, th...
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
In this paper we analyze the application of parallel and sequential evolutionary algorithms (EAs) to the automatic test data generation problem. The problem consists of automatica...
Large linguistic databases, especially databases having a global coverage such as The World Atlas of Language Structures (Haspelmath et al. 2005), The Automated Simility Judgment ...
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...