Phase type approximation for optimal auto-sleep scheduling
نویسندگان
چکیده
منابع مشابه
A distributed approximation scheme for sleep scheduling in sensor networks
We investigate the theoretical feasibility of near-optimal, distributed sleep scheduling in energyconstrained sensor networks with pairwise sensor redundancy. In this setting, an optimal sleep schedule is equivalent to an optimal fractional domatic partition of the associated redundancy graph. We present a set of realistic assumptions on the structure of the communication and redundancy relatio...
متن کاملmodeling loss data by phase-type distribution
بیمه گران همیشه بابت خسارات بیمه نامه های تحت پوشش خود نگران بوده و روش هایی را جستجو می کنند که بتوانند داده های خسارات گذشته را با هدف اتخاذ یک تصمیم بهینه مدل بندی نمایند. در این پژوهش توزیع های فیزتایپ در مدل بندی داده های خسارات معرفی شده که شامل استنباط آماری مربوطه و استفاده از الگوریتم em در برآورد پارامترهای توزیع است. در پایان امکان استفاده از این توزیع در مدل بندی داده های گروه بندی ...
Analysis and Approximation of Optimal Co-Scheduling on Chip Mulitprocessors
Cache sharing among processors is important for Chip Multiprocessors to reduce inter-thread latency, but also brings cache contention, degrading program performance considerably. Recent studies have shown that job coscheduling can effectively alleviate the contention, but it remains an open question how to efficiently find optimal co-schedules. Solving the question is critical for determining t...
متن کامل[Delayed sleep phase type sleep disorder and chronotherapy].
Delayed sleep phase type sleep disorder is a circadian rhythm disorder that results in symptoms of sleep-onset insomnia and difficulty awakening at a desired time. Patients with delayed sleep phase-type sleep disorder can be treated with chronotherapy, light therapy, vitamin B12, or melatonin. Chronotherapy is a behavioral technique in which sleep time is systematically delayed. Herein we repor...
متن کاملAuto-Approximation of Graph Computing
In the big data era, graph computing is one of the challenging issues because there are numerous large graph datasets emerging from real applications. A question is: do we need to know the final exact answer for a large graph? When it is impossible to know the exact answer in a limited time, is it possible to approximate the final answer in an automatic and systematic way without having to desi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2003
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(03)90142-7