Sciweavers

4894 search results - page 221 / 979
» Choices
Sort
View
APAL
2006
64views more  APAL 2006»
15 years 7 months ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký
EOR
2008
88views more  EOR 2008»
15 years 7 months ago
Selection of a correlated equilibrium in Markov stopping games
This paper deals with an extension of the concept of correlated strategies to Markov stopping games. The Nash equilibrium approach to solving nonzero-sum stopping games may give m...
David M. Ramsey, Krzysztof Szajowski
FGCS
2008
77views more  FGCS 2008»
15 years 7 months ago
Simulation-based optimization of multiple-task GRID applications
This paper deals with the performance optimization of multiple-task applications in GRID environments. Typically such applications are launched by a Resource Manager, which only t...
Emilio Pasquale Mancini, Umberto Villano, Massimil...
FUIN
2008
73views more  FUIN 2008»
15 years 7 months ago
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic
This article investigates Krivine's realizability interpretation of classical second-order arithmetic and its recent extension handling countable choice. We will start by pre...
Paulo Oliva, Thomas Streicher
BSL
2006
73views more  BSL 2006»
15 years 7 months ago
Nonstandard arithmetic and reverse mathematics
We show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard ari...
H. Jerome Keisler