12950 search results - page 439 / 2590 » On Optimal Timed Strategies |
203
click to vote
PE
2011
Springer
15 years 1 months ago
2011
Springer
A typical polling system consists of a number of queues, attended by a single server in a fixed order. The present study derives closed-form approximations for the mean waiting t...
240
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—In this work we focus on a stochastic optimization based approach to make distributed routing and server management decisions in the context of large-scale, geographically distr...
162
click to vote
CCCG
2006
15 years 8 months ago
2006
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
152
click to vote
MST
2006
15 years 7 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
229
click to vote
DATE
2010
IEEE
15 years 5 months ago
2010
IEEE
—Starting from sequential programs, we present an approach combining data reuse, multi-level MapReduce, and pipelining to automatically find the most power-efficient designs th...