Sciweavers

1341 search results - page 17 / 269
» Periods in Extensions of Words
Sort
View
RTSS
2000
IEEE
14 years 1 months ago
Efficient Scheduling of Sporadic, Aperiodic, and Periodic Tasks with Complex Constraints
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...
Damir Isovic, Gerhard Fohler
ACL
2003
13 years 11 months ago
An Evaluation Method of Words Tendency using Decision Tree
In every text, some words have frequency appearance and are considered as keywords because they have strong relationship with the subjects of their texts, these words frequencies ...
El-Sayed Atlam, Masaki Oono, Jun-Ichi Aoe
JUCS
2002
123views more  JUCS 2002»
13 years 9 months ago
Bridging Two Hierarchies of Infinite Words
: Infinite words on a finite non-empty alphabet have been investigated in various respects. We will consider here two important strategies in approaching such words; one of them pr...
Solomon Marcus
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 7 months ago
Dynamic Scheduling of Skippable Periodic Tasks with Energy Efficiency in Weakly Hard Real-Time System
Energy consumption is a critical design issue in real-time systems, especially in battery- operated systems. Maintaining high performance, while extending the battery life between...
Santhi Baskaran, P. Thambidurai
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 9 months ago
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
Abstract. The extension of the Wagner hierarchy to blind counter automata accepting infinite words with a Muller acceptance condition is effective. We determine precisely this hier...
Olivier Finkel