Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,295 papers from all fields of science
Search
Sign In
Create Free Account
Earliest date of diagnosis:Date:Pt:^Patient:Qn
Known as:
Earliest date of diagnosis:Date:Point in time:^Patient:Quantitative
, ??????:??:???:^??:???
, Earliest Date of Dx
Expand
National Institutes of Health
Create Alert
Alert
Related topics
Related topics
1 relation
Patients
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Towards Efficient Load Balancing and Green it Mechanisms in Cloud Environment
S. Ramkumar
,
V. Vaithiyanathan
,
M. Lavanya
2014
Corpus ID: 15087405
2 Abstract: Cloud Environment allows users to access on-demand IT resources over the cyberspace based on pay per use pattern…
Expand
2013
2013
Preference-Oriented Scheduling Framework for Periodic Real-Time Tasks
Yifeng Guo
,
Hang Su
,
Dakai Zhu
2013
Corpus ID: 14228962
We consider a set of real-time periodic tasks where some tasks are preferably executed as soon as possible (ASAP) and others as…
Expand
2012
2012
Preference-Oriented Scheduling Framework and its Application to Fault-Tolerant Real-Time Systems ( Extended Version )
Yifeng Guo
,
Dakai Zhu
2012
Corpus ID: 2253672
In fault-tolerant systems, the primary and backup copies of different tasks can be scheduled together on one processor, where…
Expand
2010
2010
Scheduling of vehicle body CAN-Bus with event-triggered least slack time first technique
Shu-ju Wang
,
Tianxia Zhang
,
Guosheng Zhang
World Congress on Intelligent Control and…
2010
Corpus ID: 16338808
Dynamic schedule strategies can bring higher resource utilization of network then static ones, while techniques such as least…
Expand
2010
2010
LINEAR TOP-DOWN TREE-TO-WORD TRANSDUCERS : CHARACTERIZATION AND MINIMIZATION
Grégoire Laurence
,
Aurélien Lemay
,
Joachim Niehren
,
S. Staworko
,
M. Tommasi
2010
Corpus ID: 17154701
We present a Myhill-Nerode theorem for the class of linear deterministic topdown tree-to-word transducers (ltops), which shows…
Expand
2007
2007
On Comparing the Number of Preemptions under Earliest Deadline and Rate Monotonic Scheduling Algorithms
J. Kurose
2007
Corpus ID: 18892770
In this note we compare the occurrence of preemptions under the rate monotonic (RM) and earliest deadline (ED) policies at a…
Expand
2006
2006
On the Generation of Stateful Communication Schedules
M. Balasubramaniam
,
M. Anand
2006
Corpus ID: 8667991
Stateful Communication Schedules have been proposed with a view to provide flexible and predictable communication in real-time…
Expand
2002
2002
Computing optimal static slowdown factors for periodic tasks under EDF scheduling
R. Jejurikar
,
Rajesh K. Gupta
2002
Corpus ID: 8507868
Frequency scaling of a processor based on slowdown factors, gives considerable power savings. The slowdown factors are computed…
Expand
2000
2000
다중 공유 자원을 위한 프로세스 대수
유희준
,
이기흔
,
최진영
2000
Corpus ID: 75043868
본 논문에서는 다중자원(multiple resource)을 사용하는 시스템의 명세와 검증을 위한 프로세스 대수 ACSMR(Algebra of Communicating Shared Multiple Resources…
Expand
1998
1998
산발적인 경성 실시간 태스크를 위한 온라인 스케줄링 알고리즘
조성제
,
이석균
,
유해영
1998
Corpus ID: 75068162
매우 복잡한 분산 실시간 시스템을 개발하는데 있어 실시간 운영체제의 다중처리기 지원이 필수적이다. Earliest Deadline Algorithm(EDA)이나 Least Laxity Algorithm(LLA…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required