Sciweavers

1087 search results - page 40 / 218
» Eta-Redexes in Partial Evaluation
Sort
View
HPDC
2003
IEEE
14 years 3 months ago
Flexible Information Discovery in Decentralized Distributed Systems
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distri...
Cristina Schmidt, Manish Parashar
PAAMS
2010
Springer
14 years 2 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
DAGSTUHL
1996
13 years 11 months ago
Efficiently Generating Efficient Generating Extensions in Prolog
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalua...
Jesper Jørgensen, Michael Leuschel
DAGSTUHL
1996
13 years 11 months ago
A Uniform Approach for Compile-Time and Run-Time Specialization
As partial evaluation gets more mature, it is now possible to use this program transformation technique to tackle realistic languages and real-size application programs. However, t...
Charles Consel, Luke Hornof, François No&eu...
ITC
1998
IEEE
126views Hardware» more  ITC 1998»
14 years 1 months ago
A comprehensive approach to the partial scan problem using implicit state enumeration
This paper presents a novel technique to evaluate the noncontrollability measures of state registers for partial scan design. Our model uses implicit techniques for finite state ma...
Priyank Kalla, Maciej J. Ciesielski