Sciweavers

3378 search results - page 303 / 676
» A universe of binding and computation
Sort
View
SIGCSE
2008
ACM
113views Education» more  SIGCSE 2008»
15 years 6 months ago
Multidisciplinary students and instructors: a second-year games course
Computer games are a multi-billion dollar industry and have become an important part of our private and social lives. It is only natural, then, that the technology used to create ...
Nathan R. Sturtevant, H. James Hoover, Jonathan Sc...
NDJFL
1998
81views more  NDJFL 1998»
15 years 6 months ago
An Undecidable Linear Order That Is n-Decidable for All n
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
John Chisholm, Michael Moses
NGC
2002
Springer
111views Communications» more  NGC 2002»
15 years 6 months ago
The Power of Communication: P Systems with Symport/Antiport
In the attempt to have a framework where the computation is done by communication only, we consider the biological phenomenon of trans-membrane transport of couples of chemicals (o...
Andrei Paun, Gheorghe Paun
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 4 months ago
Fast Pseudo-Random Fingerprints
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
Yoram Bachrach, Ely Porat
HPCC
2005
Springer
16 years 10 days ago
Enabling the P2P JXTA Platform for High-Performance Networking Grid Infrastructures
Abstract. As grid sizes increase, the need for self-organization and dynamic reconfigurations is becoming more and more important, and therefore the convergence of grid computing ...
Gabriel Antoniu, Mathieu Jan, David A. Noblet