6274 search results - page 1100 / 1255 » From query complexity to computational complexity |
137
click to vote
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
149
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
156
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: The task of computing highly accurate structural alignments of proteins in very short computation time is still challenging. This is partly due to the complexity of pr...
147
Voted
BMCBI
2007
15 years 4 months ago
2007
Background: Phylogenetic profiles record the occurrence of homologs of genes across fully sequenced organisms. Proteins with similar profiles are typically components of protein c...
170
click to vote
TON
2002
15 years 4 months ago
2002
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...