Results 251 to 260 of about 2,081,615 (312)
Co-production of eENHANCE: a web platform to deliver personalised nutrition and exercise support to prevent cancer-related malnutrition and muscle loss. [PDF]
Kiss N +15 more
europepmc +1 more source
IS CORPORATISM FEASIBLE? [PDF]
ABSTRACTThis paper investigates the effects of cooperation (corporatism) on macroeconomic performance by considering a rather standard policy game between the government and a monopoly union. We stress the shortcomings of the traditional way used to model cooperation in policy games (the maximization of the weighted sum of players’ preferences), which ...
Giovanni Di Bartolomeo, Nicola Acocella
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mathematical Programming, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Fischetti, F. Glover, LODI, ANDREA
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Fischetti, F. Glover, LODI, ANDREA
openaire +1 more source
Feasible Iteration of Feasible Learning Functionals
2007For learning functions in the limit, an algorithmic learner obtains successively more data about a function and calculates trials each resulting in the output of a corresponding program, where, hopefully, these programs eventually converge to a correct program for the function.
John Case, Timo Kötzing, Todd Paddock
openaire +2 more sources
Mathematical Programming Computation, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Natashia L. Boland +5 more
openaire +5 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Natashia L. Boland +5 more
openaire +5 more sources
Mathematical Logic Quarterly, 1995
AbstractThe problem of when a recursive graph has a recursive k‐coloring has been extensively studied by Bean, Schmerl, Kierstead, Remmel, and others. In this paper, we study the polynomial time analogue of that problem. We develop a number of negative and positive results about colorings of polynomial time graphs.
Jeffrey B. Remmel, Douglas A. Cenzer
openaire +1 more source
AbstractThe problem of when a recursive graph has a recursive k‐coloring has been extensively studied by Bean, Schmerl, Kierstead, Remmel, and others. In this paper, we study the polynomial time analogue of that problem. We develop a number of negative and positive results about colorings of polynomial time graphs.
Jeffrey B. Remmel, Douglas A. Cenzer
openaire +1 more source

