Sciweavers

13784 search results - page 2681 / 2757
» On Computing Functions with Uncertainty
Sort
View
FPCA
1989
14 years 26 days ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
POPL
1989
ACM
14 years 26 days 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
COBUILD
1998
Springer
14 years 25 days ago
An Agent-Based Telecooperation Framework
Abstract. As the amount of information and communication increases dramatically new working environments must provide efficient mechanisms to maximize the benefits of these develop...
Albrecht Schmidt, Alexander Specker, Gerhard Parts...
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
14 years 25 days ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
CASES
2007
ACM
14 years 24 days ago
Rethinking custom ISE identification: a new processor-agnostic method
The last decade has witnessed the emergence of the Application Specific Instruction-set Processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user...
Ajay K. Verma, Philip Brisk, Paolo Ienne
« Prev « First page 2681 / 2757 Last » Next »