3049 search results - page 405 / 610 » On the Convergence of Bound Optimization Algorithms |
120
click to vote
ALGORITHMICA
2008
15 years 4 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...
146
Voted
MOBICOM
2006
ACM
15 years 10 months ago
2006
ACM
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
164
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
138
click to vote
ECRTS
2008
IEEE
15 years 11 months ago
2008
IEEE
Scheduling of sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal sch...
136
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...