Sciweavers

41 search results - page 6 / 9
» Task Assignment with Unknown Duration
Sort
View
RTS
2011
123views more  RTS 2011»
13 years 2 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
LLL
1999
Springer
13 years 12 months ago
Learning to Lemmatise Slovene Words
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
Saso Dzeroski, Tomaz Erjavec
NC
1998
143views Neural Networks» more  NC 1998»
13 years 9 months ago
Spotting Arabic Phonetic Features Using Modular Connectionist Architectures and a Rule-Based System
This paper reports the results of experiments in complex Arabic phonetic features identification using a rulebased system (SARPH) and modular connectionist architectures. The firs...
Sid-Ahmed Selouani, Jean Caelen
ICML
2006
IEEE
14 years 8 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
AIR
2006
152views more  AIR 2006»
13 years 7 months ago
Machine learning: a review of classification and combining techniques
Abstract Supervised classification is one of the tasks most frequently carried out by socalled Intelligent Systems. Thus, a large number of techniques have been developed based on ...
Sotiris B. Kotsiantis, Ioannis D. Zaharakis, Panay...