Objectives As a result of participating in Project HEAL (Health, Energy, and Life at Work, a mindfulness-based stress reduction [MBSR] intervention), participants will demonstrate measurable differences from preto post intervention: 1. 10% increase in knowledge, skill, attitude, & behaviour 2. 10% improvement in perceived ability to effectively manage stress 3. 10% improvement in knowledge of a...

Genetic Improvement (GI) is a form of Genetic Programming that improves an existing program. We use GI to evolve a faster version of a C++ program, a Boolean satisfiability (SAT) solver called MiniSAT, specialising it for a particular problem class, namely Combinatorial Interaction Testing (CIT), using automated code transplantation. Our GI-evolved solver achieves overall 17% improvement, makin...

abstract it is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (cc) problem. for this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional chance constrained programming is provided and then the process of defuzzification and linearization of the problem is started. a samp...

abstract regarding the imprecise or fuzzy data on the agriculture activities, applying models based on fuzzy data may be useful. in line with this condition this study tries to compare the ability of possiblistic programming approach in developing optimal solution with fuzzy and deterministic programming. to get this objective a data set obtained from 90 farmers of kohgilooye region, gathered i...

The utility of expert system generators has been widely recognized in many applications. Several generators based on concept of the paradigm object, have been recently proposed. The generator of oriented object expert system (GSEOO) offers languages that are often complex and difficult to use. We propose in this paper an extension of the expert system generator, JESS, which permits a friendly u...

We report on work towards exible algorithms for solving decision problems represented as innuence diagrams. An algorithm is given to construct a tree structure for each decision node in an innuence diagram. Each tree represents a decision function and is constructed incrementally. The decision maker can balance the cost of computing the next incremental improvement to a tree against the expecte...

In this paper, we propose a coordinate descent approach to low-rank structured semidefinite programming. The approach, which we call the Mixing method, is extremely simple to implement, has no free parameters, and typically attains an order of magnitude or better improvement in optimization performance over the current state of the art. We show that for certain problems, the method is strictly ...

An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction. Basic steps bring a disjunctive set in regular form closer to its disjunctive normal form and, in turn, produce relaxations that are at least as tight. An open question is: What are guaranteed bounds on the improvement from a basic step? ...

Recent work in combinatorial optimization indicates the high potential of combining metaheuristics with integer linear programming (ILP) techniques. We study here a hybrid system in which a memetic algorithm (MA) and a general purpose ILP solver based on branch-and-cut (B&C) are executed in parallel and continuously exchange information in a bidirectional, asynchronous way. As target problem, w...

The Outerplanar Diameter Improvement problem asks, given a graph G and an integer D, whether it is possible to add edges to G in a way that the resulting graph is outerplanar and has diameter at most D. We provide a dynamic programming algorithm that solves this problem in polynomial time. Outerplanar Diameter Improvement demonstrates several structural analogues to the celebrated and challengi...