1170 search results - page 54 / 234 » How Fast Is Too Fast |
111
Voted
ICCSA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
120
Voted
NCA
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper addresses the problem of how to service web requests quickly in order to minimize the client response time. Some of the recent work uses the idea of the Shortest Remain...
125
Voted
FCCM
2002
IEEE
15 years 7 months ago
2002
IEEE
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
130
click to vote
RTSS
2002
IEEE
15 years 7 months ago
2002
IEEE
We consider a resource synthesis technique for realtime systems where the energy budget is limited and the performance of the system depends on how resources and energy are used. ...
158
Voted
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...