Results 221 to 230 of about 1,335 (259)
Coalition of explainable artificial intelligence and quantum computing in precision medicine. [PDF]
Ray S +3 more
europepmc +1 more source
Humans, but not zebra finches, produce spontaneously isochronous song through the lifespan. [PDF]
Bertolo M +3 more
europepmc +1 more source
A genetically encoded local learning rule enables physical learning in engineered bacteria
Prakash S +5 more
europepmc +1 more source
Evolution of the frontal aslant tract and implications for primate vocalization and human speech. [PDF]
Citro S +12 more
europepmc +1 more source
Intravenous Glyburide in Medical and Endovascular-Treated Large-Core Stroke: A Subgroup Analysis of the CHARM Randomized Clinical Trial. [PDF]
Kimberly WT +17 more
europepmc +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
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

