Sciweavers

3328 search results - page 420 / 666
» On Plateaued Functions and Their Constructions
Sort
View
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 11 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
ESOP
1999
Springer
15 years 11 months ago
An Idealized MetaML: Simpler, and More Expressive
MetaML is a multi-stage functional programming language featuring three constructs that can be viewed as statically-typed refinements of the back-quote, comma, and eval of Scheme....
Eugenio Moggi, Walid Taha, Zine-El-Abidine Benaiss...
PEPM
1999
ACM
15 years 11 months ago
Declarative Aspect-Oriented Programming
Aspect-oriented programming addresses the problem that the implementation of some properties such as error handling and optimization tends to cross-cut the basic functionality. To...
Ralf Lämmel
HT
1998
ACM
15 years 11 months ago
Enforcing Strong Object Typing in Flexible Hypermedia
The presentation layer of hypermedia systems could benefit from standard object querying functionality and this is most effective if strong typing is enforced. By strong typing we...
Pedro Furtado, Henrique Madeira
ICFEM
1997
Springer
15 years 11 months ago
Development and Application of a Formal Agent Framework
Previous work has addressed the development of a framework to categorise and understand agent-based systems. It described and formalised an agent-hierarchy that included objects, ...
Mark d'Inverno, Michael Luck