نتایج جستجو برای: dynamic sleepwake up algorithm
تعداد نتایج: 1948834 فیلتر نتایج به سال:
This paper discusses a sentence generation system PROTECTOR which uses: (i) a non-hierarchical semantic representation which allows for flexible lexical choice and un~form treatment of different languages, (ii) a lexicalised D-Tree Grammar which is very similar to TreeAdjoining Grammar in spirit, and {iii) dynamic programming techniques to avoid doing redundant computations. We review the motiv...
Résumé. Nous présentons DYALOG-SR, un analyseur syntaxique statistique par dépendances développé dans le cadre de la tâche SPRML 2013 portant sur un jeu de 9 langues très différentes. L’analyseur DYALOG-SR implémente un algorithme d’analyse par transition (à la MALT), étendu par utilisation de faisceaux et de techniques de programmation dynamique. Une des particularité de DYALOG-SR provient de ...
The purpose of this study was to investigate the acute effect of different stretching methods, during a warm-up, on the acceleration and speed of soccer players. The acceleration performance of 20 collegiate soccer players (body height: 177.25 ± 5.31 cm; body mass: 65.10 ± 5.62 kg; age: 16.85 ± 0.87 years; BMI: 20.70 ± 5.54; experience: 8.46 ± 1.49 years) was evaluated after different warm-up p...
In this paper, a dynamic evidential clustering algorithm (DEC) is introduced to address the computational burden of existing methods. To derive such solution, an FCM-like objective function first employed and minimized obtain support levels real singletons (specific) clusters which query objects belong, then initially adaptively assigned outlier, precise or imprecise one via new rule-based on c...
this thesis is a study on insurance fraud in iran automobile insurance industry and explores the usage of expert linkage between un-supervised clustering and analytical hierarchy process(ahp), and renders the findings from applying these algorithms for automobile insurance claim fraud detection. the expert linkage determination objective function plan provides us with a way to determine whi...
The motion control of a biped robot that can climb up and down stairs is studied in this work. The algorithm generates walking patterns with desired stable margin and walking speed. Only the approximate stair height and width are required. This algorithm derives the optimal hip height and uses cubic polynomial to generate the hip and foot trajectory. The control of initial and final speeds in a...
The performance of an algorithm often critically depends on its parameter configuration. While a variety automated configuration methods have been proposed to relieve users from the tedious and error-prone task manually tuning parameters, there is still lot untapped potential as learned static, i.e., settings remain fixed throughout run. However, it has shown that some parameters are best adjus...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید