Sciweavers

43264 search results - page 8231 / 8653
» Comparing models of computation
Sort
View
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 7 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
107
Voted
ATAL
2006
Springer
15 years 7 months ago
Tractable negotiation in tree-structured domains
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
134
Voted
COOPIS
2004
IEEE
15 years 7 months ago
Learning Classifiers from Semantically Heterogeneous Data
Semantically heterogeneous and distributed data sources are quite common in several application domains such as bioinformatics and security informatics. In such a setting, each dat...
Doina Caragea, Jyotishman Pathak, Vasant Honavar
CASES
2006
ACM
15 years 7 months ago
Efficient architectures through application clustering and architectural heterogeneity
Customizing architectures for particular applications is a promising approach to yield highly energy-efficient designs for embedded systems. This work explores the benefits of arc...
Lukasz Strozek, David Brooks
123
Voted
CASES
2006
ACM
15 years 7 months ago
Incremental elaboration for run-time reconfigurable hardware designs
We present a new technique for compiling run-time reconfigurable hardware designs. Run-time reconfigurable embedded systems can deliver promising benefits over implementations in ...
Arran Derbyshire, Tobias Becker, Wayne Luk
« Prev « First page 8231 / 8653 Last » Next »