From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Satisfiability Modulo Graph Theory for Task Mapping and Scheduling on Multiprocessor Systems., , , , и . IEEE Trans. Parallel Distributed Syst., 22 (8): 1382-1389 (2011)Energy-Aware Adaptive Mixed-Criticality Scheduling with Semi-Clairvoyance and Graceful Degradation., , и . ACM Trans. Embed. Comput. Syst., 23 (1): 11:1-11:20 (января 2024)Two-Bit Networks for Deep Learning on Resource-Constrained Embedded Devices, , , и . (2017)2-bit quantization.HLC-PCP: A resource synchronization protocol for certifiable mixed criticality scheduling., , , и . J. Syst. Archit., (2016)An Integrated Approach to Modeling and Analysis of Embedded Real-Time Systems Based on Timed Petri Net., и . ICDCS, стр. 350-359. IEEE Computer Society, (2003)Integration of resource synchronization and preemption-thresholds into EDF-based mixed-criticality scheduling algorithm., , и . RTCSA, стр. 227-236. IEEE Computer Society, (2013)Analysis of Event-Driven Real-Time Systems with Time Petri Nets: A Translation-Based Approach., и . DIPES, том 219 из IFIP Conference Proceedings, стр. 31-40. Kluwer, (2002)Optimization of Static Task and Bus Access Schedules for Time-Triggered Distributed Embedded Systems with Model-Checking., , и . DAC, стр. 294-299. IEEE, (2007)PT-AMC: integrating preemption thresholds into mixed-criticality scheduling., , и . DATE, стр. 141-146. EDA Consortium San Jose, CA, USA / ACM DL, (2013)An efficient technique for analysis of minimal buffer requirements of synchronous dataflow graphs with model checking., , , , и . CODES+ISSS, стр. 61-70. ACM, (2009)