2252 search results - page 213 / 451 » Lower Bounds for Dynamic Algorithms |
140
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
174
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Energy consumption is a critical design issue in real-time systems, especially in battery- operated systems. Maintaining high performance, while extending the battery life between...
136
Voted
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
154
Voted
AI
2010
Springer
15 years 3 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
180
click to vote
MOBIHOC
2004
ACM
16 years 3 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...