Global ETD Search

1	Dspptool: A Tool To Support Distributed Software Project Planning Yilmaz Yagiz, Sevil 01 March 2004 (has links) (PDF) This thesis focuses on the development of a distributed software project planning tool that enables more than one participant to prepare the different parts of the project scope, schedule and task assignment by allowing to utilize the predefined organizational level processes. For this purpose, we discuss the need for a distributed software project planning tool, identify tool requirements and compare available tools with respect to the requirements. In addition, we evaluate the tool based on two criteria: first one is the tool&rsquo / s adequacy to meet the identified functional attributes and the second one is the validation of the tool by utilizing the data of the project schedule of a real project. This tool enables preparation of project scope, schedule and task assignments in a more effective, accurate and seamless way. QA Computer Software 76.75-76.765
2	Optimalizace plánování úkolů pro management pomocí Sharepoint / Management Tasks Planning Optimalization Using Sharepoint Winkler, Tomáš January 2015 (has links) The problem discussed in this thesis is the optimization of the process of planning, tracking and evaluating tasks in the management area of the department Corporate Technology in Siemens, Brno. Having studied theories of CMMI and principles of ISO 9001, the given process is optimized by automating certain manual tasks. As Corporate Technology uses a SharePoint server to manage tasks, the application is developed to improve his functionality. This application has therefore been tested in the environment of the organization with real-life data and complies to all necessary requirements to be able to save at least 50 % of time in the optimized process. The results of this thesis prove the usability of automating manual repetitive tasks being conducted in the processes of the organization and introduce possibility of increasing process level by preventing human errors.
3	Learning Partial Policies for Intractable Domains on Tractable Subsets. / Lärande av ofullständiga strategier för svårlärda domäner via lättlärda delmängder. Carlsson, Viktor January 2023 (has links) The field of classical planning deals with designing algorithms for generating plans or squences of actions that achieve specific goals. It involves representing a problem domain as a set of state variables, actions and goals, and then developing search algorithms that can explore the state of possible plans to find the one that satisfies the specified goal. Classical planning domains are often NP-hard, meaning that their worst-case complexity grows exponentially with the size of the problem. This means that as the number of state variables, actions and goals in the problem domain increases, the search space grows exponentially, making it very difficult to find a plan that satisfies the specified goal. This thesis is concerned with investigating these NP-hard domains, specifically by simplifying these domains into ones that have a polynomial solving time, creating a general policy of conditions and rules for which actions to take for the simplified domain, and then attempting to apply this policy onto the original domain. This creates a partial policy for the original domain, and the performance of this policy can be measured in order to judge its effectiveness. This can be explained as simplifying an intractable domain into a tractable one, creating a general policy for the tractable domain and then measuring its performance as a partial policy for the intractable domain. Classical Planning Planning Artificial Intelligence Transport Nurikabe NP-hard NP-hardness Computational Complexity Polynomial Polynomial Time P P-SPACE Planning Domain Planning Domains Planning Task Planning Tasks State States State Space General Policy Partial Policy Computer Systems Datorsystem

1

Page generated in 0.0631 seconds