4155 search results - page 144 / 831 » External Memory Algorithms |
117
Voted
STACS
2004
Springer
15 years 10 months ago
2004
Springer
Under the robot model, we show that a robot needs Ω(n log d) bits of memory to perform exploration of digraphs with n nodes and maximum out-degree d. We then describe an algorith...
134
click to vote
WCET
2010
15 years 2 months ago
2010
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduc...
132
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
150
Voted
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
145
click to vote
IJCNN
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—Acquisition and representation of semantic concepts is a necessary requirement for the understanding of natural languages by cognitive systems. Word games provide an int...