Results 261 to 270 of about 1,181,281 (295)
ERα–PADI4–CXCL8 Axis Drives MDSC‐Mediated Immune Evasion in Anaplastic Thyroid Carcinoma
Advanced Science, EarlyView.MAPK‐driven ligand‐independent ERα activation drives PADI4 transcription and translation. This enzyme then modifies CXCL8 chemokines through citrullination, generating a potent chemoattractant gradient specifically for myeloid‐derived suppressor cells.
Dongdong Zhang +5 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Provably Difficult Combinatorial Games
SIAM Journal on Computing, 1979For a number of two-person combinatorial games, the problem of determining the outcome of optimal play from a given starting position (that is, of determining which player, if either, has a forced win) is shown to be complete in exponential time with respect to logspace-reducibility.
Ashok K. Chandra
exaly +4 more sources
New Techniques for Cost Sharing in Combinatorial Optimization Games [PDF]
Mathematical Programming, 2010 Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games.
Adam N. Letchford, Alberto Caprara
exaly +5 more sources
2008
Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe, solitaire and hex. The main challenge of combinatorial game theory is to handle combinatorial chaos, where
openaire +1 more source
Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe, solitaire and hex. The main challenge of combinatorial game theory is to handle combinatorial chaos, where
openaire +1 more source
On the Impact of Combinatorial Structure on Congestion Games
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006We study the impact of combinatorial structure in congestion games on the complexity of computing pure Nash equilibria and the convergence time of best response sequences. In particular, we investigate which properties of the strategy spaces of individual players ensure a polynomial convergence time.
Heiner Ackermann +2 more
openaire +4 more sources
Covert Channels in Combinatorial Games
Proceedings of the Fifth International Conference on Simulation Tools and Techniques, 2012Philip C. Ritchey, Vernon Rego
openaire +2 more sources