697 search results - page 59 / 140 » On the Theory of Average Case Complexity |
SIGECOM
2005
ACM
15 years 5 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
GG
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
106
click to vote
IISWC
2009
IEEE
15 years 6 months ago
2009
IEEE
In many areas such as e-commerce, mission-critical N-tier applications have grown increasingly complex. They are characterized by non-stationary workloads (e.g., peak load several...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...