Sciweavers

6054 search results - page 785 / 1211
» Implementation of Andorra-based Languages
Sort
View
GRAMMARS
2002
119views more  GRAMMARS 2002»
15 years 6 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
ARTMED
1999
56views more  ARTMED 1999»
15 years 6 months ago
Refining instructional text generation after evaluation
In this paper, we describe how user-adapted explanations about drug prescriptions can be generated from already existing data sources. We start by illustrating the two-step approa...
Fiorella de Rosis, Floriana Grasso, Dianne C. Berr...
RIA
2007
123views more  RIA 2007»
15 years 6 months ago
Continuations pour la programmation de comportement d'agent
Continuations are a well established programming concept that allows capturing and resuming the current program state. They can be found in several functional programming languages...
Denis Jouvin
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 5 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
IJLT
2010
115views more  IJLT 2010»
15 years 5 months ago
Computer supported ubiquitous learning environment for vocabulary learning
: Ubiquitous computing could help the organisation and the mediation of social interactions wherever and whenever these situations might occur. Using those technologies enables the...
Hiroaki Ogata, Chengjiu Yin, Moushir M. El-Bishout...