14382 search results - page 2742 / 2877 » Time in Connectionist Models |
100
Voted
MICRO
2009
IEEE
15 years 9 months ago
2009
IEEE
Transactional Memory aims to provide a programming model that makes parallel programming easier. Hardware implementations of transactional memory (HTM) suffer from fewer overhead...
127
Voted
BICOB
2009
Springer
15 years 9 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
143
Voted
WDAG
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
115
click to vote
WINE
2009
Springer
15 years 9 months ago
2009
Springer
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...
130
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Decentralised coordination in multi-agent systems is typically achieved using communication. However, in many cases, communication is expensive to utilise because there is limited...