Sciweavers

1347 search results - page 265 / 270
» On the Structure of the Minimum Time Function
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
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...
Albert Xin Jiang, MohammadAli Safari
DSD
2010
IEEE
144views Hardware» more  DSD 2010»
13 years 7 months ago
On-chip Scan-Based Test Strategy for a Dependable Many-Core Processor Using a NoC as a Test Access Mechanism
—Periodic on-chip scan-based tests have to be applied to a many-core processor SoC to improve its dependability. An infrastructural IP module has been designed and incorporated i...
Xiao Zhang, Hans G. Kerkhoff, Bart Vermeulen
ALMOB
2008
124views more  ALMOB 2008»
13 years 7 months ago
A scoring matrix approach to detecting miRNA target sites
Background: Experimental identification of microRNA (miRNA) targets is a difficult and time consuming process. As a consequence several computational prediction methods have been ...
Simon Moxon, Vincent Moulton, Jan T. Kim
ALMOB
2007
155views more  ALMOB 2007»
13 years 7 months ago
Finding coevolving amino acid residues using row and column weighting of mutual information and multi-dimensional amino acid rep
Background: Some amino acid residues functionally interact with each other. This interaction will result in an evolutionary co-variation between these residues – coevolution. Ou...
Rodrigo Gouveia-Oliveira, Anders Gorm Pedersen
BMCBI
2010
129views more  BMCBI 2010»
13 years 7 months ago
A temporal precedence based clustering method for gene expression microarray data
Background: Time-course microarray experiments can produce useful data which can help in understanding the underlying dynamics of the system. Clustering is an important stage in m...
Ritesh Krishna, Chang-Tsun Li, Vicky Buchanan-Woll...