In this paper, we propose an agent-based personalized distance learning system for delivering appropriate studying materials to learners by judging learners’ degree of understanding.The main elements of our proposed system are the agents, which play the role of teacher. Based on the learning history they analyze the understanding degree of learners. To evaluate the proposed distance learning sy...

Home > Printer-friendly PDF > Internship Housing Internship Housing A challenge for many students related to their internship search is finding housing in the cities where internship opportunities exist, and many students place unnecessary restrictions on their internship search due to housing concerns. If you are considering an internship in a city not represented in this list, consider contac...

Home > Printer-friendly PDF > Internship Housing Internship Housing A challenge for many students related to their internship search is finding housing in the cities where internship opportunities exist, and many students place unnecessary restrictions on their internship search due to housing concerns. If you are considering an internship in a city not represented in this list, consider contac...

Home > Printer-friendly PDF > Internship Housing Internship Housing A challenge for many students related to their internship search is finding housing in the cities where internship opportunities exist, and many students place unnecessary restrictions on their internship search due to housing concerns. If you are considering an internship in a city not represented in this list, consider contac...

A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...

Abstract The NP-complete Vertex Cover problem asks to cover all edges of a graph by small (given) number vertices. It is among the most prominent graph-algorithmic problems. Following recent trend in studying temporal graphs (a sequence graphs, so-called layers, over same vertex set but, time, changing edge sets), we initiate study Multistage . Herein, given graph, goal find for each layer and ...