328 search results - page 66 / 66 » Reform and Practice in the Course |
SAGT
2010
Springer
13 years 3 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
SOFTWARE
2011
12 years 11 months ago
2011
Developing parallel applications is notoriously difficult, but is even more complex for desktop applications. The added difficulties are primarily because of their interactive nat...
BMCBI
2008
13 years 5 months ago
2008
Background: Network Component Analysis (NCA) has shown its effectiveness in discovering regulators and inferring transcription factor activities (TFAs) when both microarray data a...