10988 search results - page 1747 / 2198 » Algorithmic Folding Complexity |
154
Voted
SIGECOM
2010
ACM
15 years 6 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....
310
Voted
AICCSA
2008
IEEE
15 years 6 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
169
Voted
FOCS
2008
IEEE
15 years 6 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...
173
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Transcriptional gene regulation is one of the most important mechanisms in controlling many essential cellular processes, including cell development, cell-cycle contro...
194
Voted
BMCBI
2010
15 years 6 months ago
2010
Background: Identifying candidate genes in genetic networks is important for understanding regulation and biological function. Large gene expression datasets contain relevant info...