نتایج جستجو برای: plan robustness

تعداد نتایج: 170331  

Journal: :iranian journal of radiation research 0
z. falahatpour department of medical radiation engineering, shahid beheshti university, tehran, iran s.m.r. aghamiri department of medical radiation engineering, shahid beheshti university, tehran, iran r. anbiaee department of radiotherapy and oncology, imam hossein hospital, tehran, iran

background: tangential irradiation of intact breast is one of the most common procedures performed in any radiotherapy center. this method is performed by using 2d and 3d treatment planning. the aim of this study was to compare 2d with 3d plans in breast conserving radiotherapy. homogeneity of isodose, and lung received dose were compared. materials and methods: twenty patients with breast canc...

2013
Tuan Anh Nguyen Subbarao Kambhampati Minh Binh Do

Most current planners assume complete domain models and focus on generating correct plans. Unfortunately, domain modeling is a laborious and error-prone task, thus real world agents have to plan with incomplete domain models. While domain experts cannot guarantee completeness, often they are able to circumscribe the incompleteness of the model by providing annotations as to which parts of the d...

2010
Matteo Leonetti Luca Iocchi

Agent programming for robots requires different levels of abstraction and a representation formalism able to cope with several sources of complexity (e.g. parallel execution, partial observability, exogenous events, etc.). Reinforcement Learning (RL) has proved promising in improving the performance, adaptability and robustness of plans although it still does not easily scale to the domains of ...

2014
Štefan Konečný Sebastian Stock Federico Pecora Alessandro Saffiotti

Robots are expected to carry out complex plans in real world environments. This requires the robot to track the progress of plan execution and detect failures which may occur. Planners use very abstract world models to generate plans. Additional causal, temporal, categorical knowledge about the execution, which is not included in the planner’s model, is often available. Can we use this knowledg...

2011
Paul C. Bouman J. M. van den Akker Han Hoogeveen

Real-life planning problems are often complicated by the occurrence of disturbances, which imply that the original plan cannot be followed anymore and some recovery action must be taken to cope with the disturbance. In such a situation it is worthwhile to arm yourself against common disturbances. Well-known approaches to create plans that take possible, common disturbances into account are robu...

2014
Zhu Weidong Liu Jingyu

Taking the new product line project of company X for example, the approach based on information entropy theory is utilized to test the effectiveness, robustness and applicability of the method. Based on the computation results, the evaluation scores of alternative seven plans is 0.7468, 0.5444, 0.6266, 0.8059, 0.6274, 0.5546 and 0.5983. The optimal choice for mangers to choose is plan 4. The re...

2012
Sebastian Bauersfeld Tanja E. J. Vos

Graphical User Interfaces (GUIs) can be found in almost all modern desktop, tablet and smartphone applications. Since they are the glue between an application’s components, they lend themselves to system level testing. Unfortunately, although many tools promise automation, GUI testing is still an inherently difficult task and involves great manual labor. However, tests that aim at critical faul...

2014
Miquel Ramírez Sebastian Sardiña

We present a novel approach to fully-observable nondeterministic planning (FOND) that attempts to bridge the gap between symbolic fix-point computation and recent approaches based on forward heuristic search. Concretely, we formalize the relationship between symbolic and dynamic programming nondeterministic planners, and then exploit such connection to propose a novel family of planning algorit...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید