407 search results - page 34 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
180
click to vote
ICML
2003
IEEE
16 years 6 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
141
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
178
click to vote
DAC
2010
ACM
2010
ACM
A probabilistic and energy-efficient scheduling approach for online application in real-time systems
15 years 9 months ago
This work considers the problem of minimizing the power consumption for real-time scheduling on processors with discrete operating modes. We provide a model for determining the ex...
155
click to vote
JAL
2006
15 years 6 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
158
click to vote
ESA
2001
Springer
15 years 10 months ago
2001
Springer
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...