7988 search results - page 1034 / 1598 » A Useful Undecidable Theory |
229
click to vote
ATAL
2010
Springer
15 years 8 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...
265
Voted
AAMAS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract The advent of large-scale distributed systems poses unique engineering challenges. In open systems such as the internet it is not possible to prescribe the behaviour of al...
187
click to vote
AO
2007
15 years 7 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...
260
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: Structure identification of dynamic models for complex biological systems is the cornerstone of their reverse engineering. Biochemical Systems Theory (BST) offers a pa...
215
click to vote
BMCBI
2008
15 years 7 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...