Sciweavers

4757 search results - page 795 / 952
» Monads for Functional Programming
Sort
View
ESTIMEDIA
2005
Springer
15 years 12 months ago
Custom Processor Design Using NISC: A Case-Study on DCT algorithm
Designing Application-Specific Instruction-set Processors (ASIPs) usually requires designing a custom datapath, and modifying instruction-set, instruction decoder, and compiler. A...
Bita Gorjiara, Daniel D. Gajski
GECCO
2005
Springer
196views Optimization» more  GECCO 2005»
15 years 12 months ago
Providing information from the environment for growing electronic circuits through polymorphic gates
This paper deals with the evolutionary design of programs (constructors) that are able to create (n+2)-input circuits from n-input circuits. The growing circuits are composed of p...
Michal Bidlo, Lukás Sekanina
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 12 months ago
The molecule evoluator: an interactive evolutionary algorithm for designing drug molecules
To help chemists design new drugs, we created a tool that uses interactive evolution to design drug molecules, the “Molecule Evoluator”. In contrast to most other evolutionary...
Eric-Wubbo Lameijer, Adriaan P. IJzerman, Joost N....
154
Voted
ICALP
2005
Springer
15 years 12 months ago
Basing Cryptographic Protocols on Tamper-Evident Seals
Abstract. In this paper we attempt to formally study two very intuitive physical models: sealed envelopes and locked boxes, often used as illustrations for common cryptographic ope...
Tal Moran, Moni Naor
ICALP
2005
Springer
15 years 12 months ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf