3 resultados para Problem of induction. Inductive logic. Probability
em Reposit
Biased Random-key Genetic Algorithms For The Winner Determination Problem In Combinatorial Auctions.
Resumo:
Abstract In this paper, we address the problem of picking a subset of bids in a general combinatorial auction so as to maximize the overall profit using the first-price model. This winner determination problem assumes that a single bidding round is held to determine both the winners and prices to be paid. We introduce six variants of biased random-key genetic algorithms for this problem. Three of them use a novel initialization technique that makes use of solutions of intermediate linear programming relaxations of an exact mixed integer-linear programming model as initial chromosomes of the population. An experimental evaluation compares the effectiveness of the proposed algorithms with the standard mixed linear integer programming formulation, a specialized exact algorithm, and the best-performing heuristics proposed for this problem. The proposed algorithms are competitive and offer strong results, mainly for large-scale auctions.
Resumo:
We studied the clinical aspects of 100 consecutive premature newborns with and without intraventricular and periventricular hemorrhage (IPVH).The diagnosis of IPVH was obtained by ultrasonic scans of the skull during the first week of life and at the age of one month. Forty eight percent of newborns with IPVH had abnormal results, and there was a significant correlation with the neurological evaluation in 85% of the infants. The probability of normality for a child with no associated brain abnormalities was 72%, whereas for a child of the same gestational age with associated brain abnormalities was 48.7%.
Resumo:
Universidade Estadual de Campinas. Faculdade de Educação Física