( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complexity of Scheduling in Synthesizing Hardware from Concurrent Action Oriented Specifications.

, , , и . Power-aware Computing Systems, том 07041 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)

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.

S Hilt

S Ulrich

S Hüttelmaier

S Leopold

S Steinlechner

 

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

Using instance-level constraints in agglomerative hierarchical clustering: theoretical and empirical results., и . Data Min. Knowl. Discov., 18 (2): 257-282 (2009)Controlling opinion bias in online social networks., , и . WebSci, стр. 165-174. ACM, (2012)Descriptive Clustering: ILP and CP Formulations with Applications., , , , и . IJCAI, стр. 1263-1269. ijcai.org, (2018)Compact Location Problems with Budget and Communication Constraints., , , и . COCOON, том 959 из Lecture Notes in Computer Science, стр. 510-519. Springer, (1995)E-petition Information Diffusion in Online Social Networks., , , , , , и . DG.O, стр. 515-517. ACM, (2016)Adversarial Scheduling in Evolutionary Game Dynamics, , и . CoRR, (2008)The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract)., , и . ICALP, том 700 из Lecture Notes in Computer Science, стр. 76-87. Springer, (1993)A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs., , , , , и . ESA, том 855 из Lecture Notes in Computer Science, стр. 424-435. Springer, (1994)Exploiting Data Flow Information in Algorithm-Based Fault Tolerance., , и . FTCS, стр. 280-289. IEEE Computer Society, (1993)Design and analysis of test schemes for algorithm-based fault tolerance., , и . FTCS, стр. 106-113. IEEE Computer Society, (1990)