Studying real-life data of a large Danish university, we present an Integer programming model which can be utilized to perform the complete room allocation for a semester. A course at this university has traditionally...
详细信息
the proceedings contain 40 papers. the topics discussed include: an integer programming approach for the physician rostering problem;constraint reformulation for nurse rostering problems;a unified nurse rostering mode...
ISBN:
(纸本)9780992998424
the proceedings contain 40 papers. the topics discussed include: an integer programming approach for the physician rostering problem;constraint reformulation for nurse rostering problems;a unified nurse rostering model based on XHSTT;modeling history in nurse rostering;KHE18: a solver for nurse rostering;bi-criteria simulated annealing algorithms for the robust university course timetabling problem;scheduling matters some potential requirements for future rostering competitions from a practitioner's view;and optimizing mobility services.
logicprogramming is a logic-based programming paradigm, and provides languages for declarative problem solving and symbolic reasoning. In this paper, we develop new algorithms for computing logicprogramming semantic...
详细信息
Research on educational timetabling has focused mostly on highschool timetabling, university timetabling and examination timetabling. We introduce a new problem, the music school timetabling problem which is a hybrid ...
详细信息
Multi Processor System on Chips are expected to exhibit increased performance when extra memory chips exist close to their processing units. Given an architecture of such a system, equipped with private fast memories ...
详细信息
In this paper, we study Reiter's propositional default logic when the treewidth of a certain graph representation (semi-primal graph) of the input theory is bounded. We establish a dynamic programming algorithm on...
详细信息
ISBN:
(数字)9783319773131
ISBN:
(纸本)9783319773131;9783319773124
In this paper, we study Reiter's propositional default logic when the treewidth of a certain graph representation (semi-primal graph) of the input theory is bounded. We establish a dynamic programming algorithm on tree decompositions that decides whether a theory has a consistent stable extension (ExT). Our algorithm can even be used to enumerate all generating defaults (ENuMSE) that lead to stable extensions. We show that our algorithm decides EXT in linear time in the input theory and triple exponential time in the treewidth (so-called fixed-parameter linear algorithm). Further, our algorithm solves ENuMSE with a pre-computation step that is linear in the input theory and triple exponential in the treewidth followed by a linear delay to output solutions.
In the considered sequencing problem, a subset of a given set of jobs is to the be scheduled. A scheduled job has to execute without preemption and during this time, the job needs both a common resource for a part of ...
详细信息
Level editors let end-users create custom levels and content within a given video game. In this paper, we explore the concept and design of Augmented reality game level editors. these new types of editors are not only...
详细信息
ISBN:
(纸本)9781450355681
Level editors let end-users create custom levels and content within a given video game. In this paper, we explore the concept and design of Augmented reality game level editors. these new types of editors are not only spatial and embodied, but also situated, as they enable users to tailor games to the unique characteristics and emotional value of their own space. We present the design and implementation of a prototype level editor that runs on the Microsoft HoloLens. the editor enables users to add virtual content in their homes and add interactions through spatial trigger-action game-logicprogramming. We had pairs of students create games withthe prototype and play each other's games. they reported that games are fun to make, play, and watch others play. Based on the design and evaluation, we propose guidelines for Augmented reality game-authoring tools for end users.
Nurse and physician rostering problems seek to find an optimal way to assign nurses and physicians to shifts respecting a set of hard and soft constraints. If a single hard constraint is violated, the solution is cons...
详细信息
inductive learning has been employed successfully in various domains, however the inductivelogicprogramming (ILP) systems focused on non-incremental learning tasks where independent sets of data are provided incoher...
详细信息
ISBN:
(纸本)9781538616390
inductive learning has been employed successfully in various domains, however the inductivelogicprogramming (ILP) systems focused on non-incremental learning tasks where independent sets of data are provided incoherently. In this paper, we propose a new genetic algorithm-based ILP system, called GAILP, for incremental learning. GAILP is a covering algorithm which extracts hypotheses/rules from a collection of examples in a reliable way. It employs a genetic algorithm technique to discover various aspects of the potential combinations. GAILP induces every possible rule for the given combination and selects the most generic ones among them. It also eliminates rules which might become obsolete by the existence of more generic rules. Unlike other ILP systems, GAILP batches all given examples and background knowledge, then it groups the examples and prioritizes the induction process. this prioritization needs to be done to preserve dependency and to revise theory. the paper introduces GAILP's fundamentals mechanisms and demonstrates its algorithms with a running example.
暂无评论