1184 search results - page 86 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
195
click to vote
IGIS
1994
15 years 6 months ago
1994
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
132
click to vote
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
124
click to vote
DCC
2009
IEEE
16 years 3 months ago
2009
IEEE
Motivated by the paradigm of event-based monitoring, which can potentially alleviate the inherent bandwidth and energy constraints associated with wireless sensor networks, we con...
105
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
The storage requirements in data-intensive multidimensional signal processing systems have a significant impact on the system performance as well as on essential design parameter...
101
click to vote
ALGORITHMICA
2008
15 years 2 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...