234 search results - page 18 / 47 » Games and Capacities on Partitions |
104
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
92
Voted
EUROPAR
2004
Springer
15 years 5 months ago
2004
Springer
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
110
click to vote
MMS
2002
15 years 3 days ago
2002
Integration--supporting multiple application classes with heterogeneous requirements--is an emerging trend in networks, file systems, and operating systems. In this paper, we eval...
100
click to vote
ACMACE
2007
ACM
15 years 4 months ago
2007
ACM
Recently a new generation of virtual worlds has emerged in which users are provided with open-ended modelling tools with which they can create and modify world content. The result...
106
click to vote
SIROCCO
2008
15 years 1 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...