2479 search results - page 53 / 496 » A Computational Theory of Working Memory |
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
ICPP
2009
IEEE
13 years 5 months 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 ...
DIGRA
2003
Springer
14 years 26 days ago
2003
Springer
This paper examines the computer game Harry Potter and the Philosopher’s Stone in relation to the novel with the same title. The analysis focuses on the temporal aspects of the ...
CIE
2005
Springer
14 years 1 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
SIGECOM
2010
ACM
14 years 14 days ago
2010
ACM
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...