2035 search results - page 50 / 407 » Working memory |
112
click to vote
IEEEICCI
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper investigates possible connection strategies in sparsely connected associative memory models. This is interesting because real neural networks must have both efficient p...
115
click to vote
AUSAI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
123
click to vote
CC
2004
Springer
15 years 8 months ago
2004
Springer
This paper concerns static-analysis algorithms for analyzing x86 executables. The aim of the work is to recover intermediate representations that are similar to those that can be c...
109
Voted
IEEEHPCS
2010
15 years 1 months ago
2010
We analyze and present different strategies to adapt the load in transactional memory systems based on contention. Our experimental results show a substantial overall improvement ...
117
click to vote
ICPP
2009
IEEE
15 years 21 days ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...