Sciweavers

1096 search results - page 65 / 220
» Partial Evaluation of Pointcuts
Sort
View
DAGSTUHL
1996
13 years 11 months ago
A Self-Applicable Supercompiler
A supercompiler is a program which can performa deep transformation of programsusing a principle which is similarto partial evaluation, and can be referred to as metacomputation. ...
Andrei P. Nemytykh, Victoria A. Pinchuk, Valentin ...
JAIR
2008
110views more  JAIR 2008»
13 years 10 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
TCAD
2002
107views more  TCAD 2002»
13 years 9 months ago
Value-sensitive automatic code specialization for embedded software
The objective of this work is to create a framework for the optimization of embedded software. We present algorithms and a tool flow to reduce the computational effort of programs,...
Eui-Young Chung, Luca Benini, Giovanni De Micheli,...
ADC
2004
Springer
79views Database» more  ADC 2004»
14 years 3 months ago
Performance and Cost Tradeoffs in Web Search.
Web search engines crawl the web to fetch the data that they index. In this paper we re-examine that need, and evaluate the network costs associated with data acquisition, and alt...
Nick Craswell, Francis Crimmins, David Hawking, Al...
ESOP
1990
Springer
14 years 2 months ago
From Interpreting to Compiling Binding Times
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...
Charles Consel, Olivier Danvy