2373 search results - page 344 / 475 » On the Theory of Structural Subtyping |
200
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
153
click to vote
AO
2007
15 years 6 months ago
2007
One of the major goals of ontology is to represent properly the underlying conceptual structure of the messy world reflecting the reality as much as possible. Ontology building to...
176
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Nonnegative Matrix Factorization (NMF) is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face re...
177
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
192
click to vote
DM
2006
15 years 6 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...