Sciweavers

16616 search results - page 3127 / 3324
» Extending Extended Vacuity
Sort
View
SPAA
1995
ACM
15 years 10 months ago
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
For years, the computation rate of processors has been much faster than the access rate of memory banks, and this divergence in speeds has been constantly increasing in recent yea...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias,...
VRML
1995
ACM
15 years 10 months ago
Internetwork Infrastructure Requirements for Virtual Environments
Virtual environments (VEs) are a broad multidisciplinary research area that includes all aspects of computer science, virtual reality, virtual worlds, teleoperation and telepresenc...
Donald P. Brutzman, Michael R. Macedonia, Michael ...
COCO
1991
Springer
93views Algorithms» more  COCO 1991»
15 years 10 months ago
Relating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...
KR
1991
Springer
15 years 10 months ago
Meta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
Howard Barringer, Michael Fisher, Dov M. Gabbay, A...
LICS
1991
IEEE
15 years 10 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
« Prev « First page 3127 / 3324 Last » Next »