Considérées comme des moyens incontournables de participation à la société, les technologies de l’information et de la communication (TIC) constituent une piste de solution prometteuse pour l’enseignement et l’apprentissage auprès des élèves qui ont des incapacités intellectuelles. Toutefois, plusieurs auteurs…

Descripción completa.

2008

La forma en que podemos expresar un mismo pensamiento puede variar
dependiendo de las circunstancias, del objetivo que pretendemos alcanzar, etc. Esta
variabilidad del lenguaje se convierte en un problema cuando una aplicación de
procesamiento del lenguaje natural intenta extraer…

La realización de un estudio sobre cuidado en la casa de pacientes con demencia avanzada permite ilustrar como asuntos de contexto implícitos en la literatura, sesgan la comprensión que se tiene sobre el cuidado familiar. La mayoría de los estudios…

IT Outsourcing (contracting-out of Information Technology services) has become a
pivotal economic trend in recent decades. This study traces the interlacing of IT
Outsourcing with Enterprise Resource Planning (ERP) software systems. Little research
has considered the reciprocal relations between these…

This reference manual consists of two parts. The first (sections 1 through 6) is intended for those who are either interested in the ITS 1.5 time sharing monitor for its own sake or who wish to write machine language programs…

Context can be described as the totality of ideas, situations and information that (a) related to, (b) provide the origins for, and (c) influence our response, perspective or judgment of a thing. Design always takes place in a context. However,…

The present paper is about applying competence modeling for a knowledge engineer in the case of the company WBSA Sistemas Inteligentes S.A. The process was based on Lucia and Lepsinger model, by which competences are characterized through the identification of…

(cont.) Packing/Covering problems, we prove upper and lower bounds on the adaptivity gap depending on the dimension. We also design polynomial-time algorithms achieving near-optimal approximation guarantees with respect to the adaptive optimum. Finally, we prove complexity-theoretic results regarding optimal adaptive…