Sciweavers

6978 search results - page 255 / 1396
» On Proofs in System P
Sort
View
ENTCS
2007
113views more  ENTCS 2007»
15 years 6 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi
186
Voted
IPPS
2003
IEEE
15 years 12 months ago
Quantifying Locality Effect in Data Access Delay: Memory logP
The application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter-node communication in a shared mem...
Kirk W. Cameron, Xian-He Sun
167
Voted
ISIM
2007
15 years 8 months ago
Notes on Restricted P Colonies
We continue the investigation of P coloniesintroduced in [7], of abstract computing devices composed of independent agents, acting and evolving in a shared environment. We determin...
Lucie Ciencialová, Ludek Cienciala
IPPS
2008
IEEE
16 years 1 months ago
Large-scale experiment of co-allocation strategies for Peer-to-Peer supercomputing in P2P-MPI
High Performance computing generally involves some parallel applications to be deployed on the multiples resources used for the computation. The problem of scheduling the applicat...
Stéphane Genaud, Choopan Rattanapoka
HICSS
2008
IEEE
133views Biometrics» more  HICSS 2008»
16 years 1 months ago
Design of Service Systems under Variability: Research Issues
P. K. Kannan, João F. Proença