Sciweavers

375 search results - page 1 / 75
» Making Abstract Machines Less Abstract
Sort
View
FPCA
1991
13 years 9 months ago
Making Abstract Machines Less Abstract
Hannan. Making Abstract Machines Less Abstract . In Proc. of FPCA'91, LNCS 523, pages
John Hannan
POPL
1989
ACM
13 years 9 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
CONCUR
2012
Springer
11 years 7 months ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
13 years 11 months ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini
CISC
2009
Springer
148views Cryptology» more  CISC 2009»
13 years 3 months ago
A DAA Scheme Requiring Less TPM Resources
Abstract. Direct anonymous attestation (DAA) is a special digital signature primitive, which provides a balance between signer authentication and privacy. One of the most interesti...
Liqun Chen