We consider the 2-Way Multi Modal Shortest Path Problem (2WMMSPP). Its goal is to find two multi modal paths with total minimal cost, an outgoing path and a return path. The main difficulty lies in the fact that if a private car or bicycle is used during the outgoing path, it has to be picked up during the return path. The shortest return path is typically not equal to the shortest outgoing pat...

Data Structures and Algorithms is a module in most Computer Science or Information Technology curricula. It is one of the modules most students identify as being difficult. This paper demonstrates how programming a solution for Sudoku can make abstract concepts more concrete. The paper relates concepts of a typical Data Structures and Algorithms module to a step by step solution for Sudoku in a...

This paper describes the conceptual foundations to construct a method on Computer Aided Innovation for product development. It begins with a brief recap of the different methodologies and disciplines that build its bases. Evolutionary Design is presented and explained how the first activities in Genetic Algorithms (GAs) helped to produce computer shapes that resembled a creative behavior. A des...

We discuss hybrid Monte Carlo algorithms for odd-flavor lattice QCD simulations. The algorithms include a polynomial approximation which enables us to simulate odd-flavor QCD in the framework of the hybrid Monte Carlo algorithm. In order to make the algorithms exact, the correction factor to the polynomial approximation is also included in an economical, stochastic way. We test the algorithms f...

one of the most effective techniques to mitigate multipath fading and inter-cell interference at a downlink wireless channel in wcdma systems for achieving high capacity is transmitter power control. in this case, system increases the power of the subscriber when its interference increases in order to satisfy the requested signal qualities. however, when the requested signal qualities are infea...

1 This paper presents an application program interface (API) that enables applications to use application-defined scheduling algorithms in a way compatible with the scheduling algorithms defined in POSIX. Several application-defined schedulers, implemented as special user tasks, can coexist in the system in a predictable way. This API is being tested in our operating system MaRTE with the aim o...

Near-optimal gossiping algorithms are given for two-and higher dimensional tori. It is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected. For two-dimensional tori, an earlier algorithm achieved optimality in an intricate way, with a time-dependent routing pattern. In our algorithms, in all steps, the PUs forward the received packets in the ...

The Multiprotocol Label Switching (MPLS) Architecture [1] discusses a way in which Asynchronous Transfer Mode (ATM) switches may be used as Label Switching Routers. The ATM switches run network layer routing algorithms (such as Open Shortest Path First (OSPF), Intermediate System to Intermediate System (IS-IS), etc.), and their data forwarding is based on the results of these routing algorithms...

Bayesian Reinforcement Learning (RL) is capable of not only incorporating domain knowledge, but also solving the explorationexploitation dilemma in a natural way. As Bayesian RL is intractable except for special cases, previous work has proposed several approximation methods. However, these methods are usually too sensitive to parameter values, and finding an acceptable parameter setting is pra...