Sciweavers

9325 search results - page 331 / 1865
» The decentralized implementability problem
Sort
View
TC
2010
14 years 11 months ago
Speculatively Redundant Continued Logarithm Representation
Continued logarithms, as originally introduced by Gosper, represent a means for exact rational arithmetic, but their application to exact real arithmetic is limited by the uniquene...
Tomas Brabec
DATE
1999
IEEE
123views Hardware» more  DATE 1999»
15 years 8 months ago
An Algorithm for Face-Constrained Encoding of Symbols Using Minimum Code Length
Different logic synthesis tasks have been formulated as input encoding problems but restricted to use a minimum number of binary variables. This paper presents an original column ...
Manuel Martínez, Maria J. Avedillo, Jos&eac...
ARC
2007
Springer
140views Hardware» more  ARC 2007»
15 years 8 months ago
Reconfigurable Computing for Accelerating Protein Folding Simulations
Abstract. This paper presents a methodology for the design of a reconfigurable computing system applied to a complex problem in molecular Biology: the protein folding problem. An e...
Nilton B. Armstrong, Heitor S. Lopes, Carlos R. Er...
145
Voted
EUROGP
2008
Springer
135views Optimization» more  EUROGP 2008»
15 years 6 months ago
Using Genetic Programming for Turing Machine Induction
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
Amashini Naidoo, Nelishia Pillay
NIPS
2003
15 years 5 months ago
An MDP-Based Approach to Online Mechanism Design
Online mechanism design (MD) considers the problem of providing incentives to implement desired system-wide outcomes in systems with self-interested agents that arrive and depart ...
David C. Parkes, Satinder P. Singh