... above, and its implementations (both in the standard ATL Virtual Machine (VM) [5] and EMFTVM [18]), can cope with scenarios involving small or medium-size mod- ...performance and scalability rapidly ...
... journalism and to an increasing polarisation (Casero, 2012; González and Novo, 2012; Martínez Nicolás and Humanes, 2012; Van Dalen, De Vreese and Albaeck, ...companies and the political ...
... efficiency and correctness criteria for parallelization is strict independence [11], which entails the absence of shared variables at ...exploit and-parallelism be- tween goals which are dependent, ...
... study and development of new technologies that allow accomplishing this ...scopes and limitations. Clearly it is different from computer vision and image processing ...vision and image ...
... them and it also facilitates experimenting with different ...restricted and unre- stricted ...unrestricted parallelism contributes to better observed ...Keywords: Parallelism, Virtual ...
... semantic parallelism, which also serve as an analytical axis to study semantic parallelism in traditional kakataibo ...lexical and grammatical type of parallel units, type of semantic relations ...
... times and the consequence is a multiple and variable number of ...Exploration and exploitation of solutions in the searching space are distinctive characteristics of an evolutionary algorithm, ...
... benefits and limitations, described in detail in previous ...single and multiple objective optimization and behaves better than previous ...diversity and no extra adjustments seem to be ...
... a parallelism that has been widely used from the discovery of the structure of DNA (Watson & Crick ...codes and analyzes the pos- sible impact of this analogy in the design of new methodologies for ...
... uncontroversial and trivial claim that the perception of a certain situation or develop- ment in terms of crisis, failure, disorder, neces- sarily involves certain evaluative standards ...3) and that these ...
... copies and setup values in = (int *)malloc(size); fill_ints(in, N + 2*RADIUS); out = (int *)malloc(size); fill_ints(out, N + 2*RADIUS); // Alloc space for device copies cudaMalloc((void **)&d_in, size); ...