Sciweavers

1628 search results - page 32 / 326
» Compiler Construction Using Scheme
Sort
View
JSAC
2007
83views more  JSAC 2007»
13 years 7 months ago
Constructing an optimal server set in structured peer-to-peer networks
— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
Seung Chul Han, Ye Xia
GLOBECOM
2009
IEEE
14 years 2 months ago
Reusable Set Constructions Using Randomized Dissolvent Templates for Biometric Security
—The emerging biometric cryptography has gained significant interests for key management and privacy protection, but the previously proposed schemes using set metrics for finge...
Jinyang Shi, Kwok-Yan Lam, Ming Gu, Husheng Li
TCAD
2002
98views more  TCAD 2002»
13 years 7 months ago
An Esterel compiler for large control-dominated systems
Embedded hard real-time software systems often need fine-grained parallelism and precise control of timing, things typical real-time operating systems do not provide. The Esterel l...
Stephen A. Edwards
JAIR
2000
100views more  JAIR 2000»
13 years 7 months ago
On the Compilability and Expressive Power of Propositional Planning Formalisms
The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power&qu...
Bernhard Nebel
PPDP
2007
Springer
14 years 1 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty