697 search results - page 121 / 140 » On the Theory of Average Case Complexity |
CMPB
2007
13 years 7 months ago
2007
We show that it is possible to construct numerical models of eye colour from first principles. Our initial model assumes that the important optical interactions occur only in the a...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
SIGECOM
2004
ACM
14 years 1 months ago
2004
ACM
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
CASES
2006
ACM
14 years 1 months ago
2006
ACM
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...