output
20122021
most citedPros and cons gamification and gaming in classroom

102 citations

9 papers

math.CV2021

The Ptolemy-Alhazen problem and quadric surface mirror reflection

Masayo Fujimura, Marcelina Mocanu, Matti Vuorinen

We discuss the problem of the reflection of light on spherical and quadric surface mirrors. In the case of spherical mirrors, this problem is known as the Alhazen problem. For the…

math.CV2020★ 4 cited

A new intrinsic metric and quasiregular maps

Masayo Fujimura, Marcelina Mocanu, Matti Vuorinen

We introduce a new intrinsic metric in subdomains of a metric space and give upper and lower bounds for it in terms of well-known metrics. We also prove distortion results for this…

math.CV2019★ 15 cited

Barrlund's distance function and quasiconformal maps

Masayo Fujimura, Marcelina Mocanu, Matti Vuorinen

Answering a question about triangle inequality suggested by R. Li, A. Barrlund introduced a distance function which is a metric on a subdomain of We study this B…

cs.MA2018★ 5 cited

Multi-agents features on Android platforms

Camelia-M. Pintea, Andreea Camelia Tripon, Anca Avram +1

The current paper shows the multi-agents capabilities to make a valid and flexible application when using a framework. Agent-based functions were used within JADE framework to make…

cs.CY2017★ 102 cited

Pros and cons gamification and gaming in classroom

Iulian Furdu, Cosmin Tomozei, Utku Kose

The aim of the current work is to assess the challenges that gamification in education are facing nowadays. Benefits and disadvantages of using gamification in classroom are both d…

cs.NE2014★ 5 cited

On the Resilience of an Ant-based System in Fuzzy Environments. An Empirical Study

Gloria Cerasela Crisan, Camelia-M. Pintea, Petrica C. Pop

The current work describes an empirical study conducted in order to investigate the behavior of an optimization method in a fuzzy environment. MAX-MIN Ant System, an efficient impl…

cs.AI2012★ 13 cited

A hybrid ACO approach to the Matrix Bandwidth Minimization Problem

Camelia-M. Pintea, Camelia Chira, Gloria-C. Crisan

The evolution of the human society raises more and more difficult endeavors. For some of the real-life problems, the computing time-restriction enhances their complexity. The Matri…

cs.AI2012★ 13 cited

Soft Computing approaches on the Bandwidth Problem

Gabriela Czibula, Gloria Cerasela Crisan, Camelia-M. Pintea +1

The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous reordering of the rows and the columns of a square matrix such that the nonzero entries are collected with…

cs.AI2012★ 1 cited

Parallel ACO with a Ring Neighborhood for Dynamic TSP

Camelia-M. Pintea, Gloria Cerasela Crisan, Mihai Manea

The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distan…