Sciweavers

2354 search results - page 291 / 471
» A Common-Sense Theory of Time
Sort
View
ATAL
2010
Springer
15 years 7 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
BMCBI
2008
149views more  BMCBI 2008»
15 years 6 months ago
Evolution of biological sequences implies an extreme value distribution of type I for both global and local pairwise alignment s
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...
Olivier Bastien, Eric Maréchal
CPHYSICS
2008
96views more  CPHYSICS 2008»
15 years 6 months ago
Moment distributions of clusters and molecules in the adiabatic rotor model
We present a Fortran program to compute the distribution of dipole moments of free particles for use in analyzing molecular beams experiments that measure moments by deflection in...
G. E. Ballentine, G. F. Bertsch, N. Onishi, K. Yab...
CSR
2008
Springer
15 years 6 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
GC
2008
Springer
15 years 6 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati