Sciweavers

10916 search results - page 2172 / 2184
» On Constructive Connectives and Systems
Sort
View
CONCURRENCY
2000
133views more  CONCURRENCY 2000»
13 years 6 months ago
OpenMP versus threading in C/C++
When comparing OpenMP to other parallel programming models, it is easier to choose between OpenMP and MPI than between OpenMP and POSIX Threads (Pthreads). With languages like C a...
Bob Kuhn, Paul Petersen, Eamonn O'Toole
COMPUTER
2002
89views more  COMPUTER 2002»
13 years 6 months ago
A Pattern for Softcoded Values
rs use models or abstractions that hide low-level implementation details. Various kinds of representations such as data models, state-transition models, and dataflow models can hel...
Michael R. Blaha, Cheryl Smith
NRHM
2000
149views more  NRHM 2000»
13 years 6 months ago
Navigable history: a reader's view of writer's time
Collecting, analyzing, and sharing information via a hypertext results in the continuous modification of information content over a long period of time. Such tasks will benefit fr...
Frank M. Shipman III, Hao-wei Hsieh
CACM
1998
110views more  CACM 1998»
13 years 6 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
NDJFL
1998
105views more  NDJFL 1998»
13 years 6 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
« Prev « First page 2172 / 2184 Last » Next »