Sciweavers

7486 search results - page 215 / 1498
» The Limits of Quantum Computers
Sort
View
AAAI
2000
15 years 8 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
ISMB
1993
15 years 8 months ago
Computationally Efficient Cluster Representation in Molecular Sequence Megaclassification
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
David J. States, Nomi L. Harris, Lawrence Hunter
COR
2006
95views more  COR 2006»
15 years 6 months ago
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
Sancho Salcedo-Sanz, Yong Xu, Xin Yao
IJAR
2007
104views more  IJAR 2007»
15 years 6 months ago
On representation and aggregation of social evaluations in computational trust and reputation models
Interest for computational trust and reputation models is on the rise. One of the most important aspects of these models is how they deal with information received from other indi...
Jordi Sabater-Mir, Mario Paolucci
TVLSI
2002
116views more  TVLSI 2002»
15 years 6 months ago
Configuration relocation and defragmentation for run-time reconfigurable computing
Due to its potential to greatly accelerate a wide variety of applications, reconfigurable computing has become a subject of a great deal of research. By mapping the compute-intens...
Katherine Compton, Zhiyuan Li, James Cooley, Steph...