6111 search results - page 664 / 1223 » Time, Hardware, and Uniformity |
217
click to vote
APPROX
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
196
click to vote
IPPS
2005
IEEE
16 years 26 days ago
2005
IEEE
Modern server farm and cluster sites consume large quantities of energy both to power and cool the machines in the site. At the same time, less power supply redundancy is offered ...
187
click to vote
MOBICOM
2004
ACM
16 years 21 days ago
2004
ACM
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
191
click to vote
FOCS
2002
IEEE
16 years 7 days ago
2002
IEEE
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
193
Voted
SIGGRAPH
1993
ACM
15 years 11 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...