16666 search results - page 2664 / 3334 » Descriptive and Computational Complexity |
206
click to vote
SIGECOM
2010
ACM
15 years 7 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....
211
click to vote
FOCS
2008
IEEE
15 years 7 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...
236
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Genome-Wide Association (GWA) analysis is a powerful method for identifying loci associated with complex traits and drug response. Parts of GWA analyses, especially th...
220
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Modern omics research involves the application of high-throughput technologies that generate vast volumes of data. These data need to be pre-processed, analyzed and in...
203
click to vote
BMCBI
2007
15 years 7 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...