533 search results - page 93 / 107 » Playing games with approximation algorithms |
STOC
2006
ACM
14 years 7 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...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
SMA
2006
ACM
14 years 1 months ago
2006
ACM
As compatible meshes play important roles in many computeraided design applications, we present a new approach for modelling compatible meshes. Our compatible mesh modelling metho...
SIGMOD
2007
ACM
14 years 7 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 ...