Code Shoppy

Finding Matrimonial Circuits in some AmerindianKinship Networks: an Experimental Study We consider the problem of deciding the existenceof matrimonial circuits, and finding implexa in kinship networks.These networks can be modeled by acyclic digraphs. A mat-rimonial circuit can be seen as vertex-disjoint directed pathsfrom special starting to special ending vertices of these acyclicdigraphs. An implex is the set of all matrimonial circuits ofa given pair of special vertices. We present methods based onEppstein’s reduction [3] and algorithms for finding junctions [5]to decide the existence of matrimonial circuits. The efficiencyof these methods is shown in our empirical results on sevenAmerindian kinship networks. To enumerate all implexa, wepresent an algorithm, given that the kinship network is limited.We present some descriptive statistics which help us to justifythe good performance of the methods. We incorporate to oursoftware tool, the Kinship Machine [2], a feature to enume...

Exam Seating Arrangement System Academic institutions are moving toward automated management of the educational process. One aspect of this process is the exam scheduling. The large number of students, classes, professors, and venues renders the manual scheduling process tedious and useless. In this paper, we describe the efforts of the Arab East College for High Education in Saudi Arabia in scheduling exams in the least number of conflicts, among other constraints. We give the details for a two-stage solution approach; the first stage is a greedy algorithm and the second one is a genetic algorithm. The two algorithms work in tandem to generate the best exam timetable. Automation of this process has greatly reduced the number of conflicts, exam days, and the required venues. Problem Complexity: Now, given this initial set of con- straints, the technique complexity can be established; The exam scheduling problem is an NP-hard problem. The other parameters, like the class enr...