From post

Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming.

, , , и . QAPL, том 190 из Electronic Notes in Theoretical Computer Science, стр. 111-127. Elsevier, (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.

 

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

D-Fusion: A Distinctive Fusion Calculus., , и . APLAS, том 3302 из Lecture Notes in Computer Science, стр. 296-310. Springer, (2004)Connector Algebras, Petri Nets, and BIP., , и . Ershov Memorial Conference, том 7162 из Lecture Notes in Computer Science, стр. 19-38. Springer, (2011)Mapping Fusion and Synchronized Hyperedge Replacement into logic programming., и . Theory Pract. Log. Program., 7 (1-2): 123-151 (2007)A Modular LTS for Open Reactive Systems., , и . IFIP TCS, том 7604 из Lecture Notes in Computer Science, стр. 134-148. Springer, (2012)On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs., , , и . Fundam. Informaticae, 134 (3-4): 287-317 (2014)Reconfigurable and Software-Defined Networks of Connectors and Components., , и . The ASCENS Approach, том 8998 из Lecture Notes in Computer Science, Springer, (2015)On the Minimization of READ-ONLY Memories in Microprogrammed Digital Computers., и . IEEE Trans. Computers, 19 (11): 1111-1114 (1970)Final semantics for the pi-calculus., , , и . PROCOMET, том 125 из IFIP Conference Proceedings, стр. 225-243. Chapman & Hall, (1998)Networks of constraints: Fundamental properties and applications to picture processing.. Inf. Sci., (1974)Concurrency and Probability: Removing Confusion, Compositionally., , и . CoRR, (2017)