An edge-coloring of a simple graph G with colors 1, 2,..., t is called an interval t-Coloring 3] if at least one edge of G is colored by color i, i = 1, ..., t.Expand

We combine interactive evolutionary computation (IEC) with existing evolutionary synthesis software for the design of micromachined resonators and evaluate its effectiveness using human evaluation of the final designs and a test for statistical significance.Expand

An automated design synthesis system based on a multi-objective genetic algorithm (MOGA) has been developed for the optimization of surface micromachined MEMS devices.Expand

We compare the Single Objective Genetic Algorithm (SOGA) and MOGA against Simulated Annealing (SA) in terms of robustness, effectiveness and speed.Expand

For bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper) bound for the cardinality of its maximum matching.Expand

A translation from Russian of the work of R. Kamalian "Interval colorings of complete bipartite graphs and trees", Preprint of the Computing Centre of the Academy of Sciences of Armenia, Yerevan.Expand

We use the design of a MEMS resonator as a case study and explore the role that geometric constraints and human interaction play in a computer-aided MEMS design system based on genetic algorithms.Expand