Institute of Computer Science - ICS Research

Solving Different Problems Simultaneously with Artificial Chemistry

Webmaster — Wed, 19 Nov 2008 16:28:16 +0800

Start: 2008-12-15 09:00

End: 2008-12-15 10:00

Speaker Name(s): Jaderick P. Pabico

Seminar Location: ICS-LH3

Seminar Abstract:

The traveling salesman problem (TSP), job-shop scheduling, vehicle routing, scheduling of aircraft landing, gene sequencing, and many others are combinatorial optimization problems whose solutions are of real-world importance. However, combinatorial optimization problems are NP-hard because even though exact algorithms exist to solve these problems, they are inefficient for large instances of the problem. To solve these problems at larger instances, two general heuristics are used: graph-based and distributed multi-agent-based. These heuristics were developed to find near-optimal (and sometimes, optimal) solutions within a given time. An example of graph-based heuristics is the popular branch and bound. Distributed multi-agent-based methods abound such as genetic algorithms, memetic algorithms, tabu search, simulated annealing, simulated jumping, neural networks, and swarm intelligence.

Three ICS Research Papers Published in the Philippine IT Journal.

Webmaster — Fri, 24 Oct 2008 12:25:20 +0800

Three ICS research papers presented during the 6th National Conference on IT Education (NCITE 2008) were published in the second issue of the first volume of the Philippine Information Technology Journal (PITJ). The journal is jointly published by the Philippines Society of Information Technology Educators (PSITE) and the Computing Society of the Philippines (CSP).

Perceptions of Social Loafing and its Measurements in Undergraduate Computer Programming Groups

Webmaster — Wed, 08 Oct 2008 15:22:36 +0800

J.P. PABICO, C.D. De Sagun, J.P.C. Galang and J.A.C. Hermocilla, 2008 Network of CALABARZON Educational Institutions, Inc. (NOCEI) Research Forum, Batangas State University, Alangilan, Batangas, 21 November 2008.

Abstract

Social Loafing is the term used to describe the tendency of an individual to decrease efforts when working in a group compared to when working alone. This behavioral tendency of a member has been known to negatively affect the performance of groups. Researchers, however, found out that there are various antecedents to social loafing such as task visibility, distributive justice, task contribution, dominance, aggression and sucker effect. To be able to design better computer science courses, we would like to find out if social loafing and its antecedents exist in undergraduate groups organized for solving computing problems.