28,779 research outputs found

    Gaming Business Communities: Developing online learning organisations to foster communities, develop leadership, and grow interpersonal education

    Get PDF
    This paper explores, through observation and testing, what possibilities from gaming can be extended into other realms of human interaction to help bring people together, extend education, and grow business. It uses through action learning within the safety of the virtual world within Massively Multiplayer Online Games. Further, I explore how the world of online gaming provides opportunity to train a wide range of skills through extending Revans’ (1980) learning equation and action inquiry methodology. This equation and methodology are deployed in relation to a gaming community to see if the theories could produce strong relationships within organisations and examine what learning, if any, is achievable. I also investigate the potential for changes in business (e.g., employee and customer relationships) through involvement in the gaming community as a unique place to implement action learning. The thesis also asks the following questions on a range of extended possibilities in the world of online gaming: What if the world opened up to a social environment where people could discuss their successes and failures? What if people could take a real world issue and re‐create it in the safe virtual world to test ways of dealing with it? What education answers can the world of online gaming provide

    The Phase Diagram of 1-in-3 Satisfiability Problem

    Get PDF
    We study the typical case properties of the 1-in-3 satisfiability problem, the boolean satisfaction problem where a clause is satisfied by exactly one literal, in an enlarged random ensemble parametrized by average connectivity and probability of negation of a variable in a clause. Random 1-in-3 Satisfiability and Exact 3-Cover are special cases of this ensemble. We interpolate between these cases from a region where satisfiability can be typically decided for all connectivities in polynomial time to a region where deciding satisfiability is hard, in some interval of connectivities. We derive several rigorous results in the first region, and develop the one-step--replica-symmetry-breaking cavity analysis in the second one. We discuss the prediction for the transition between the almost surely satisfiable and the almost surely unsatisfiable phase, and other structural properties of the phase diagram, in light of cavity method results.Comment: 30 pages, 12 figure

    Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimize total tardiness

    Get PDF
    The permutation flow shop scheduling problem is one of the most studied operations research related problems. Literally, hundreds of exact and approximate algorithms have been proposed to optimise several objective functions. In this paper we address the total tardiness criterion, which is aimed towards the satisfaction of customers in a make-to-order scenario. Although several approximate algorithms have been proposed for this problem in the literature, recent contributions for related problems suggest that there is room for improving the current available algorithms. Thus, our contribution is twofold: First, we propose a fast beam-search-based constructive heuristic that estimates the quality of partial sequences without a complete evaluation of their objective function. Second, using this constructive heuristic as initial solution, eight variations of an iterated-greedy-based algorithm are proposed. A comprehensive computational evaluation is performed to establish the efficiency of our proposals against the existing heuristics and metaheuristics for the problem.Ministerio de Ciencia e Innovación DPI2013-44461-PMinisterio de Ciencia e Innovación DPI2016-80750-

    Free Search of real value or how to make computers think

    Get PDF
    This book introduces in detail Free Search - a novel advanced method for search and optimisation. It also deals with some essential questions that have been raised in a strong debate following the publication of this method in journal and conference papers. In the light of this debate, Free Search deserves serious attention, as it appears to be superior to other competitive methods in the context of the experimental results obtained. This superiority is not only quantitative in terms of the actual optimal value found but also qualitative in terms of independence from initial conditions and adaptation capabilities in an unknown environment
    corecore