In this paper, the researchers have investigated a Concatenated Robot Move (CRM) sequence problem and Minimal Part Set (MPS) schedule problem with different setup times for two-machine robotic cell. They have focused on simultaneous solving of CRM sequence and MPS schedule problems with different loading and unloading times. They have applied a Simulated Annealing (SA) algorithm to provide a go...

We introduce the tidy set, a minimal simplicial set that captures the topology of a simplicial complex. The tidy set is particularly effective for computing the homology of clique complexes. This family of complexes include the Vietoris-Rips complex and the weak witness complex, methods that are popular in topological data analysis. The key feature of our approach is that it skips constructing ...

RULE REDUCTS BASED ON ROUGH SET THEORY Şahin Emrah AMRAHOV Computer Engineering Department , Ankara University, Ankara, Turkey Fatih AYBAR Computer Engineering Department, Ankara University, Ankara, Turkey Serhat DOĞAN Economics Department, Bilkent University, Ankara, Turkey In this paper it is considered rule reduct generation problem, based on Rough Set Theory. Rule Reduct Generation (RG) and...