10805 search results - page 1828 / 2161 » Mapping Computation with No Memory |
225
Voted
BIBM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Unacceptable execution time of Non-rigid registration (NRR) often presents a major obstacle to its routine clinical use. Parallel computing is an effective way to accele...
192
click to vote
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
171
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
180
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
213
click to vote
EMSOFT
2007
Springer
16 years 27 days ago
2007
Springer
We address the problem of mapping a set of processes which communicate synchronously on a distributed platform. The Time Triggered Architecture (TTA) proposed by Kopetz for the co...