In treatment planning we depend upon accurate knowledge of geometric and range uncertainties. If the uncertainty model is inaccurate then the plan will produce under-dosing of the target and/or overdosing of OAR. We aim to provide a method for which centre and site-specific population range uncertainty due to inter-fraction motion can be quantified to improve the uncertainty model in proton tre...

A case study of the Sacramento Basin is undertaken to examine problems of planning for the impacts of climate change on water resources utilizing output from general circulation climate models. This work provides a sensitivity analysis linking climate, stream ̄ow, and planning decisions. Water resource planners want reliable time series of stream ̄ow in the basin. Sacramento basin hydrological mo...

The last 15 years have seen a rapid growth in the popularity of e-planning in Australia and internationally. In this paper I wish e-planning to be understood as a range of planning activities that are taking place online. Eplanning can refer variously to the systems used to submit and track development applications online, online planning certification tools, blogs and discussion forums hosted ...

The long, medium and short term planning of Hungarian backbone and Budapest trunk networks in Hungarian Telecom are based on the software package PLANET, which covers a wide range of the transmission planning activities. The paper describes the PDH and SDH network planning tools, the planning processes and the resulted networks. Main present features of Hungarian backbone and Budapest trunk net...

Genetic programming (GP) is an automatic programming technique that has recently been applied to a wide range of problems including blocks-world planning. This paper describes a series of illustrative experiments in which GP techniques are applied to traditional blocks-world planning problems. We discuss genetic planning in the context of traditional AI planning systems, and comment on the cost...

the rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. for noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. in this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, generaliz...

Genetic programming (GP) is an automatic programming technique that has recently been applied to a wide range of problems including blocks-world planning. This paper describes a series of illustrative experiments in which GP techniques are applied to traditional blocks-world planning problems. We discuss genetic planning in the context of traditional AI planning systems, and comment on the cost...

Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning problems many times faster than the best current planning systems. Although stochastic methods have...