Sciweavers

2540 search results - page 412 / 508
» Abstract Logics as Dialgebras
Sort
View
ICFP
2010
ACM
13 years 10 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
KAIS
2002
95views more  KAIS 2002»
13 years 8 months ago
Enhanced Proxy Caching with Content Management
In this paper, we propose a novel approach to enhancing web proxy caching, an approach that integrates content management with performance tuning techniques. We first develop a hie...
Kai Cheng, Yahiko Kambayashi
TCS
2002
13 years 8 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
VISUALIZATION
1999
IEEE
14 years 1 months ago
A Distributed Graphics System for Large Tiled Displays
Recent interest in large displays has led to renewed development of tiled displays, which are comprised of several individual displays arranged in an array and used as one large l...
Greg Humphreys, Pat Hanrahan
IPPS
1998
IEEE
14 years 1 months ago
A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective Intelligence
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
Tadeusz Szuba