Sciweavers

9405 search results - page 368 / 1881
» Computing a Model of Set Theory
Sort
View
POPL
2006
ACM
16 years 6 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
CLUSTER
2009
IEEE
16 years 1 months ago
Granules: A lightweight, streaming runtime for cloud computing with support, for Map-Reduce
— Cloud computing has gained significant traction in recent years. The Map-Reduce framework is currently the most dominant programming model in cloud computing settings. In this ...
Shrideep Pallickara, Jaliya Ekanayake, Geoffrey Fo...
CPHYSICS
2008
123views more  CPHYSICS 2008»
15 years 6 months ago
wannier90: A tool for obtaining maximally-localised Wannier functions
We present wannier90, a program for calculating maximally-localised Wannier functions (MLWF) from a set of Bloch energy bands that may or may not be attached to or mixed with othe...
Arash A. Mostofi, Jonathan R. Yates, Young-Su Lee,...
IPPS
2009
IEEE
16 years 28 days ago
Robust sequential resource allocation in heterogeneous distributed systems with random compute node failures
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...
Vladimir Shestak, Edwin K. P. Chong, Anthony A. Ma...
FSS
2008
127views more  FSS 2008»
15 years 6 months ago
On the computing power of fuzzy Turing machines
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
Benjamín René Callejas Bedregal, San...