Sciweavers

1448 search results - page 189 / 290
» Restricted Stack Implementations
Sort
View
ML
2008
ACM
13 years 9 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
TC
2008
13 years 9 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
JOT
2007
138views more  JOT 2007»
13 years 9 months ago
Flexible Language Interoperability
machines raise the abstraction level of the execution environment at the cost of restricting the set of supported languages. Moreover, the ability of a language implementation to i...
Torbjörn Ekman, Peter Mechlenborg, Ulrik Pagh...
ENTCS
2007
145views more  ENTCS 2007»
13 years 9 months ago
Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks
Wireless sensor networks are comprised of a vast number of ultra-small autonomous computing, communication and sensing devices, with restricted energy and computing capabilities, ...
Ioannis Chatzigiannakis, Elisavet Konstantinou, Va...
TON
1998
107views more  TON 1998»
13 years 8 months ago
Migrating sockets--end system support for networking with quality of service guarantees
—We present an end system architecture designed to support networking with quality of service (QoS) guarantees. The protocol processing component of the architecture, called Migr...
David K. Y. Yau, Simon S. Lam