Titlebook: Smart Education and e-Learning 2017; Vladimir L. Uskov,Robert J. Howlett,Lakhmi C. Jain Conference proceedings 2018 The Editor(s) (if appl

歌唱队

Lubov S. Lisitsyna,Evgenii A. Efimchik,Svetlana A. IzgarevaAn essential task in state-space exploration techniques for the verification of concurrent programs consists in finding points in an execution where alternative actions are possible. Here, the nondeterministic executions of a program can be represented by a tree-like structure. Given the . of a conc

新娘

Hugh Considine,Andrew Nafalski,Zorica Nedic. The transformation consists of two well-known program transformations: translation to continuation-passing style that uncovers the control flow of the evaluator and Reynolds’s defunctionalization that generates a first-order transition function. Ever since the transformation was first described by

defray

Andrey V. Lyamin,Elena N. Cherepovskayaroblems in Turing-complete languages. However, some declarative languages offer a practical work-around for this problem, by making a clear distinction between whether a program is meant to be understood inductively or coinductively. For programs meant to be understood inductively, termination must

健谈的人

Asta Slotkienėroblems in Turing-complete languages. However, some declarative languages offer a practical work-around for this problem, by making a clear distinction between whether a program is meant to be understood inductively or coinductively. For programs meant to be understood inductively, termination must

我没有强迫

Nataliya G. Tagiltseva,Svetlana A. Konovalova,Nataliya I. Kashina,Elvira M. Valeeva,Oksana A. Ovsyaniable-free, propositional programs. The size of this grounding depends heavily on the size of the non-ground rules, and thus, reducing the size of such rules is a promising approach to improve solving performance. To this end, in this paper we announce lpopt, a tool that decomposes large logic progr

蒙太奇

laceration

A精确的

slipped-disk

Galina Samigulina,Adlet Nyussupov,Assem Shayakhmetovaning as used in high-performance computing. Our auto-tuning is an important use case of the general concept of automated algorithm configuration and parameter tuning: we optimize parallel programs by finding the optimal values of the performance-critical program parameters for a particular high-perf

和音

Martina Hedvicakova,Libuse Svobodovaning as used in high-performance computing. Our auto-tuning is an important use case of the general concept of automated algorithm configuration and parameter tuning: we optimize parallel programs by finding the optimal values of the performance-critical program parameters for a particular high-perf