Sciweavers

3663 search results - page 238 / 733
» Problems in the ontology of computer programs
Sort
View
TC
2002
15 years 6 months ago
The Timely Computing Base Model and Architecture
Abstract-- Current systems are very often based on largescale, unpredictable and unreliable infrastructures. However, users of these systems increasingly require services with time...
Paulo Veríssimo, Antonio Casimiro
IPPS
2010
IEEE
15 years 4 months ago
A PRAM-NUMA model of computation for addressing low-TLP workloads
It is possible to implement the parallel random access machine (PRAM) on a chip multiprocessor (CMP) efficiently with an emulated shared memory (ESM) architecture to gain easy par...
Martti Forsell
LPNMR
2009
Springer
16 years 1 months ago
Translating Preferred Answer Set Programs to Propositional Logic
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
Vernon Asuncion, Yan Zhang
ICLP
2005
Springer
16 years 4 days ago
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
Hans Tompits, Stefan Woltran
SC
2003
ACM
15 years 12 months ago
ParADE: An OpenMP Programming Environment for SMP Cluster Systems
Demand for programming environments to exploit clusters of symmetric multiprocessors (SMPs) is increasing. In this paper, we present a new programming environment, called ParADE, ...
Yang-Suk Kee, Jin-Soo Kim, Soonhoi Ha