Building on Robinson’s (2001, 2003) Cognition Hypothesis, Skehan’s (1998) Limited Attentional Capacity Model, and Kellog’s (1986) model of writing, this study examined the effect of task planning on the fluency, accuracy, and complexity of 60 Iranian EFL learners’ argumentative and narrative writings under different planning conditions. A quasi-experimental design with three levels of planning ...

Recently model checking representation and search techniques were shown to be eeciently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (obdds) to encode a planning domain as a non-deterministic nite automaton (NFA) and then apply fast algorithms from model checking to search for a solution. obdds can eeectively ...

There are a number of different dwell positions and time optimisation options available in the Oncentra® Brachy (Elekta Brachytherapy Solutions, Veenendaal, The Netherlands) brachytherapy treatment planning system. The purpose of this case study was to compare graphical (GRO) and inverse planning by simulated annealing (IPSA) optimisation techniques for interstitial head and neck (HN) and prost...

network expansion studies normally offer new power lines, new substations or expansion of existing substations. they are generally proposed based on technical requirements, but financial restrictions are not considered. because of financial restrictions, ranking of network expansion plans is required. in this paper an algorithm for such ranking, based on technical and financial view points and ...

Optimal plans of delete-free planning tasks are interesting both in domains that have no delete effects and as the relaxation heuristic h in general planning. Many heuristics for optimal and satisficing planning approximate the h heuristic, which is well-informed and admissible but intractable to compute. In this work, branch-and-bound and IDA∗ search are used in a search space tailored to dele...

In classical planning, the polynomial-time computability of propositional delete-free planning (planning with only positive effects and preconditions) led to the highly successful Relaxed Graphplan heuristic. We present a hierarchy of new computational complexity results for different classes of propositional delete-free HTN planning, with two main results: We prove that finding a plan for the ...

Reinforcement learning (RL) agents can reduce learning time dramatically by planning with learned predictive models. Such planning agents learn to improve their actions using planning trajectories, sequences of imagined interactions with the environment. However, planning agents are not intrinsically driven to improve their predictive models, which is a necessity in complex environments. This p...

The evaluation of patients in the emergency room department (ER) through more accurate imaging methods such as computed tomography (CT) has revolutionized their assistance in the early 80s. However, despite technical improvements seen during the last decade, surgical planning in the ER has not followed the development of image acquisition methods. The authors present their experience with DICOM...

Urban planning has played different roles ever since cities first came into existence – it has been used to build defensible cities, cities that are symbols of power and prestige, cities that are functional, and cities that are sustainable and equitable. Its role in the aftermath of conflict has also changed and evolved over the years, sometimes driven by design, sometimes by circumstance. Rece...