10805 search results - page 264 / 2161 » Mapping Computation with No Memory |
208
click to vote
TSMC
2010
15 years 1 months ago
2010
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
194
click to vote
MICRO
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper presents ReMAP, a reconfigurable architecture geared towards accelerating and parallelizing applications within a heterogeneous CMP. In ReMAP, threads share a common rec...
155
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
191
click to vote
CSJM
2006
15 years 6 months ago
2006
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
169
click to vote
IWINAC
2007
Springer
16 years 24 days ago
2007
Springer
The computer model of visual attention derives an interest or saliency map from an input image in a process that encompasses several data combination steps. While several combinati...