نتایج جستجو برای: consistent technique

تعداد نتایج: 910664  

2016
Shourya Roy Sandipan Dandapat Ajay Nagesh Y. Narahari

Automatic short answer grading (ASAG) techniques are designed to automatically assess short answers written in natural language having a length of a few words to a few sentences. In this paper, we report an intriguing finding that the set of short answers to a question, collectively, share significant lexical commonalities. Based on this finding, we propose an unsupervised ASAG technique that o...

2007
Carlos Grandón Gilles Chabert Bertrand Neveu

This paper deals with systems of parametric equations over the reals, in the framework of interval constraint programming. As parameters vary within intervals, the solution set of a problem may have a non null volume. In these cases, an inner box (i.e., a box included in the solution set) instead of a single punctual solution is of particular interest, because it gives greater freedom for choos...

Journal: :Mobile Information Systems 2022

Recommending travel routes for tourists has become a research hotspot in the present tourism industry. Various machine learning methods have been well studied recommendation systems. However, accuracy of these systems is not up to expected levels. In order increase ranking accuracy, as as, recall rate recommended by personalized algorithm, this paper, fuzzy consistent matrix technique introduce...

2005
Marcin Bienkowski Miroslaw Korzeniowski

In Peer-to-Peer networks based on consistent hashing and ring topology each peer is responsible for an interval chosen (pseudo-) randomly on a circle. The topology of the network, the communication load and the amount of data a peer stores depends heavily on the length

Journal: :CoRR 2015
Ben Appleton Michael O'Reilly

1 Abstract We describe a consistent hashing algorithm which performs multiple lookups per key in a hash table of nodes. It requires no additional storage beyond the hash table, and achieves a peak-to-average load ratio of 1 + ε with just 1 + 1 ε lookups per key.

2003
Kentaro Tanaka Akimichi Takemura

We consider maximum likelihood estimation of finite mixture of uniform distributions. We prove that the maximum likelihood estimator is strongly consistent, if the scale parameters of the component uniform distributions are restricted from below by exp(−nd), 0 < d < 1, where n is the sample size.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه گیلان - دانشکده علوم انسانی 1391

the present study sought to investigate the impact of using mind-mapping technique instruction on female elementary efl learners reading comprehension; it also investigated their attitudes towards using mind-mapping technique as a tool to improve their reading comprehension. this study followed a quasi-experimental design with two intact groups as experimental, and control groups. the participa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید