1984 search results - page 385 / 397 » The colourful feasibility problem |
IMC
2007
ACM
13 years 11 months ago
2007
ACM
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
INFOSCALE
2007
ACM
13 years 11 months ago
2007
ACM
We present a query-driven algorithm for the distributed indexing of large document collections within structured P2P networks. To cope with bandwidth consumption that has been ide...
NSDI
2010
13 years 11 months ago
2010
Today, large-scale web services run on complex systems, spanning multiple data centers and content distribution networks, with performance depending on diverse factors in end syst...
SDM
2007
SIAM
13 years 11 months ago
2007
SIAM
Abnormal events, such as security attacks, misconfigurations, or electricity failures, could have severe consequences toward the normal operation of the Border Gateway Protocol (...