Genetic Improvement (GI) is an area of Search Based Software Engineering which seeks to
improve software's non-functional properties by treating program code as if it were genetic …

Nowadays, many industrial SAT instances can be solved efficiently by modern SAT solvers.
However, the number of real-world instances is finite. Therefore, the process of development …

Genetic improvement uses automated search to find improved versions of existing software.
Genetic improvement has previously been concerned with improving a system with respect …

Nowadays, modern SAT solvers are able to efficiently solve many industrial, or real-world,
SAT instances. However, the process of development and testing of new SAT solving …

In the last decades, we have witnessed a remarkable success of algorithms solving the
Boolean Satisfiability problem (SAT) on instances encoding application or real-world …

Consider a complete communication network on n nodes. In synchronous 2-counting, the
nodes receive a common clock pulse and they have to agree on which pulses are “odd” and …

We consider the problem of fast zeta and M\" obius transforms in finite posets, particularly in
lattices. It has previously been shown that for a certain family of lattices, zeta and M\" obius …

Hoy en día, muchos problemas del mundo real son codificados en instancias SAT y
resueltos eficientemente por modernos SAT solvers. Estos solvers, usualmente conocidos …

Life, even in its most basic of forms, continues to amaze mankind with the complexity of its
design. When analysing this complexity it is easy to see why the idea of a grand designer …

The propositional satisfiability problem (SAT) is one of the most prominent and widely
studied NP-hard problems. The development of SAT solvers, whether it is carried out …