1092 search results - page 164 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
157
click to vote
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....
162
click to vote
BMCBI
2007
2007
FUNC: a package for detecting significant associations between gene sets and ontological annotations
15 years 6 months ago
Background: Genome-wide expression, sequence and association studies typically yield large sets of gene candidates, which must then be further analysed and interpreted. Informatio...
182
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...
189
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Diagnosing faults in aircraft gas turbine engines is a complex problem. It involves several tasks, including rapid and accurate interpretation of patterns in engine sensor data. W...
175
click to vote
SIAMDM
1998
15 years 6 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...