18306 search results - page 3390 / 3662 » Algorithmics in Exponential Time |
217
Voted
POPL
2003
ACM
16 years 3 months ago
2003
ACM
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
137
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
138
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
138
Voted
STOC
2002
ACM
16 years 3 months ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
237
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
The proliferation of database-driven web sites (or web-databases) has brought upon a plethora of applications where both Quality of Service (QoS) and Quality of Data (QoD) are of ...