Results 61 to 70 of about 75,650 (220)
Efficient management of backtracking in and-parallelism
, 1986 A backtracking algorithm for AND-Parallelism and its implementation at the Abstract Machine level are presented: first, a class of AND-Parallelism models based on goal independence is defined, and a generalized version of Restricted AND-Parallelism (RAP)
Nasr, Roger I., Hermenegildo, Manuel V.
core
Parallel Power Flow Computation Trends and Applications: A Review Focusing on GPU
Energies, 2020 A power flow study aims to analyze a power system by obtaining the voltage and phase angle of buses inside the power system. Power flow computation basically uses a numerical method to solve a nonlinear system, which takes a certain amount of time ...
Dong-Hee Yoon, Youngsun Han
doaj +1 more source
Distance: a New Metric for Controlling Granularity for Parallel Execution [PDF]
, 1997 Granularity control is a method to improve parallel execution performance by limiting excessive parallelism. The general idea is that if the gain obtained by executing a task in parallel is less than the overheads required to support parallel execution ...
Santos Costa, Vitor +8 more
core
, 2007 Most efficient implementations of parallel logic programming rely on complex low-level machinery which is arguably difficult to implement and modify.
Manuel V. Hermenegildo +5 more
core
Exploiting Parallelism in the Design of Peer-to-Peer Overlays [PDF]
, 2008 Many peer-to-peer overlay operations are inherently parallel and this parallelism can be exploited by using multi-destination multicast routing, resulting in significant message reduction in the underlying network.
Brown, Alan +2 more
core +1 more source
Parallel algorithms for series parallel graphs [PDF]
, 1996 In this paper, a parallel algorithm is given that, given a graph G=(V, E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log¦E¦log*¦E¦) time and O(¦E¦) operations on an EREW PRAM, andO(log¦E¦) time and O(¦E¦) operations on a CRCW PRAM (note that ...
Hans L. Bodlaender, Babette de Fluiter
openaire +4 more sources
Complete and efficient methods for supporting side effects in independent/restricted and-parallelism
, 1989 It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of such programs.
Muthukumar, Kalyan +3 more
core
Relating data—parallelism and (and—) parallelism in logic programs [PDF]
, 1996 Much work has been done in the áreas of and-parallelism and data parallelism in Logic Programs. Such work has proceeded to a certain extent in an independent fashion. Both types of parallelism offer advantages and disadvantages.
Manuel V. Hermenegildo +3 more
core +1 more source
Towards high-level execution primitives for and-parallelism: preliminary results
, 2007 Most implementations of parallel logic programming rely on complex low-level machinery which is arguably difflcult to implement and modify. We explore an alternative approach aimed at taming that complexity by raising core parts of the implementation to ...
Hermenegildo, Manuel V. +2 more
core
Figures of Argument (OSSA 2005 Keynote Address)
Informal Logic, 2004 From the seventeenth through the nineteenth centuries, scientists such as Kekule, Mendel, Lavoisier and Harvey argued for insights that depended critically on antithetical expressions and reasoning.
Jeanne Fahnestock
doaj +1 more source