1 In this paper a data driven analysis of FelderSilverman Index of Learning Styles (ILS) is given. Results, obtained by Multiple Correspondence Analysis and cross-validated by cor...
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
This paper describes and evaluates various general stemming approaches for the French, Portuguese (Brazilian), German and Hungarian languages. Based on the CLEF test-collections, ...
— This article presents an evolution of classical SPMD programming for clusters and grids. It is named ”Object-Oriented SPMD” as it is based on remote method invocation. More...
— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...