Sciweavers

1017 search results - page 139 / 204
» A General Model for Authenticated Data Structures
Sort
View
ICFP
2012
ACM
11 years 11 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
MSWIM
2003
ACM
14 years 2 months ago
Simulation of large ad hoc networks
An ad hoc network is formed by wireless mobile nodes (hosts) that operate as terminals as well as routers in the network, without any centralized administration. Research in ad ho...
Valeriy Naoumov, Thomas R. Gross
SIGMETRICS
2003
ACM
147views Hardware» more  SIGMETRICS 2003»
14 years 2 months ago
Effect of node size on the performance of cache-conscious B+-trees
In main-memory databases, the number of processor cache misses has a critical impact on the performance of the system. Cacheconscious indices are designed to improve performance b...
Richard A. Hankins, Jignesh M. Patel
ENTCS
2007
121views more  ENTCS 2007»
13 years 9 months ago
Incremental Parametric Development of Greedy Algorithms
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
Dominique Cansell, Dominique Méry
RCC
2000
113views more  RCC 2000»
13 years 8 months ago
The Aristotle Approach to Open Hypermedia
Large-scale distributed hypermedia systems comprise a generation of powerful tools to meet the demands of the new information globalization era. The most promising of such systems...
Costas Petrou, Drakoulis Martakos, Michael Hatzopo...