Sciweavers

7576 search results - page 263 / 1516
» UNIX as an Application Program
Sort
View
DEXAW
2008
IEEE
93views Database» more  DEXAW 2008»
16 years 1 months ago
Overlay GHC: An Extension of Guarded Horn Clauses for Overlay Programming
Today’s high-speed network allows sophisticated applications of overlay networks. Meanwhile, usage of multicore processors has been spreading. The level of concurrency we need t...
Kenji Saito
LPNMR
2009
Springer
15 years 11 months ago
Computing Weighted Solutions in Answer Set Programming
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to solutions, and then pick the ...
Duygu Çakmak, Esra Erdem, Halit Erdogan
LPAR
2001
Springer
15 years 11 months ago
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
Samir Genaim, Michael Codish
HPDC
1996
IEEE
15 years 10 months ago
Shared Memory NUMA Programming on I-WAY
The performance of the Global Array shared-memory nonuniform memory-access programming model is explored on the I-WAY, wide-area-network distributed supercomputer environment. The...
Jarek Nieplocha, Robert J. Harrison
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 10 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe