@inproceedings{17868, abstract = {{The paper describes an approach for an aggregated animation of a simulation experiment in an interactive 3D environment, visualizing multiple, distributed simulation runs. Although the general approach of a 3-dimensional visualization of material flow simulation helps to understand the dynamic behavior of a system better as well as faster, it remains unclear, how typical the animated simulation represents the model, if there is a stochastic influence for even some parameters. By the integrated visualization of multiple distributed simulation runs, this uncertainty can be solved, which will be shown in this paper for a typical simulation study of a queuing system. }}, author = {{Dangelmaier, Wilhelm and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Suess, Tim}}, booktitle = {{2008 Winter Simulation Conference}}, isbn = {{9781424427079}}, pages = {{2012--2020}}, title = {{{Aggregated 3D-visualization of a distributed simulation experiment of a queuing system}}}, doi = {{10.1109/wsc.2008.4736296}}, year = {{2008}}, } @inproceedings{19003, author = {{Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}}, booktitle = {{Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)}}, isbn = {{9783540699002}}, issn = {{0302-9743}}, pages = {{378--389}}, title = {{{The Kinetic Facility Location Problem}}}, doi = {{10.1007/978-3-540-69903-3_34}}, year = {{2008}}, } @inproceedings{19004, abstract = {{We present a deterministic kinetic data structure for the facility location problem that maintains a subset of the moving points as facilities such that, at any point of time, the sum of the maintenance cost for the facilities and the connection cost for the clients is at most a constant factor larger than the current optimal cost. In our scenario, each point can open a facility and moves continuously along a known trajectory in a d-dimensional Euclidean space where d is a constant. Our kinetic data structure has a storage requirement of O(n (log^d(n)+log(nR))), where n is the number of points and R is the ratio of the product of the maximum maintenance cost and demand to the product of their corresponding minimum values. In the case that each trajectory can be described by a bounded degree polynomial, the data structure processes O(n^2 log^2(nR)) events, each requiring only O(log(nR)) facility changes and O(log^(d+1)(n) log(nR)) time. This results in a total processing time of O(n^2 log^(d+1)(n) log^3(nR)). To the best of our knowledge, this is the first kinetic data structure for the facility location problem.}}, author = {{Gehweiler, Joachim and Lammersen, Christiane and Degener, Bastian}}, booktitle = {{Proceedings of the 24th European Workshop on Computational Geometry}}, pages = {{251--254}}, title = {{{The Kinetic Facility Location Problem}}}, year = {{2008}}, } @inproceedings{1926, author = {{Scheideler, Christian and W. Richa, Andr{\'{e}}a and Santi, Paolo}}, booktitle = {{Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008}}, isbn = {{978-1-60558-073-9}}, pages = {{91----100}}, publisher = {{ACM}}, title = {{{An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model}}}, doi = {{10.1145/1374618.1374632}}, year = {{2008}}, } @article{1937, author = {{Scheideler, Christian}}, journal = {{Bulletin of the EATCS}}, pages = {{130----152}}, title = {{{Algorithms for Overlay Networks}}}, year = {{2008}}, } @inproceedings{1938, author = {{Awerbuch, Baruch and W. Richa, Andr{\'{e}}a and Scheideler, Christian}}, booktitle = {{Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008}}, isbn = {{978-1-59593-989-0}}, pages = {{45----54}}, publisher = {{ACM}}, title = {{{A jamming-resistant MAC protocol for single-hop wireless networks}}}, doi = {{10.1145/1400751.1400759}}, year = {{2008}}, } @inproceedings{1940, author = {{Mense, Mario and Scheideler, Christian}}, booktitle = {{Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008}}, pages = {{1135----1144}}, publisher = {{SIAM}}, title = {{{SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems}}}, year = {{2008}}, } @inproceedings{1941, author = {{Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}}, booktitle = {{Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings}}, isbn = {{978-3-540-89334-9}}, pages = {{124----140}}, publisher = {{Springer}}, title = {{{Tiara: A Self-stabilizing Deterministic Skip List}}}, doi = {{10.1007/978-3-540-89335-6_12}}, volume = {{5340}}, year = {{2008}}, } @inbook{1942, author = {{Scheideler, Christian}}, booktitle = {{Taschenbuch der Algorithmen}}, isbn = {{978-3-540-76393-2}}, pages = {{229----236}}, publisher = {{Springer}}, title = {{{Broadcasting: Wie verbreite ich schnell Informationen?}}}, doi = {{10.1007/978-3-540-76394-9_22}}, year = {{2008}}, } @proceedings{1943, editor = {{Hegering, Heinz-Gerd and Lehmann, Axel and Jürgen Ohlbach, Hans and Scheideler, Christian}}, isbn = {{978-3-88579-227-7}}, title = {{{INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland}}}, volume = {{133}}, year = {{2008}}, } @book{1945, author = {{Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea}}, isbn = {{978-3-540-76393-2}}, title = {{{Taschenbuch der Algorithmen}}}, year = {{2008}}, } @inproceedings{2356, author = {{Brinkmann, André and Gudenkauf, Stefan and Hasselbring, Wilhelm and Höing, André and Karl, Holger and Kao, Odej and Nitsche, Holger and Scherp, Guido}}, booktitle = {{Proc. Cracow Grid Workshop (CGW)}}, pages = {{103--110}}, title = {{{Employing WS-BPEL Design Patterns for Grid Service Orchestration using a Standard WS-BPEL Engine and a Grid Middleware}}}, year = {{2008}}, } @inproceedings{2358, author = {{Beisel, Tobias and Lietsch, Stefan and Thielemans, Kris}}, booktitle = {{IEEE Nuclear Science Symposium Conference Record (NSS)}}, pages = {{4161--4168}}, publisher = {{IEEE}}, title = {{{A method for OSEM PET reconstruction on parallel architectures using STIR}}}, doi = {{10.1109/NSSMIC.2008.4774198}}, year = {{2008}}, } @inproceedings{2365, author = {{Platzner, Marco and Döhre, Sven and Happe, Markus and Kenter, Tobias and Lorenz, Ulf and Schumacher, Tobias and Send, Andre and Warkentin, Alexander}}, booktitle = {{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}}, isbn = {{1-60132-064-7}}, pages = {{245--251}}, publisher = {{CSREA Press}}, title = {{{The GOmputer: Accelerating GO with FPGAs}}}, year = {{2008}}, } @proceedings{2376, editor = {{Brinkmann, André and Karl, Holger}}, publisher = {{Paderborn Center for Parallel Computing, Paderborn University}}, title = {{{Proceedings of the 1. GI/ITG KuVS Fachgespräch Virtualisierung}}}, year = {{2008}}, } @inproceedings{20367, author = {{Hamann, Heiko and Wörn, Heinz}}, booktitle = {{The tenth International Conference on Simulation of Adaptive Behavior (SAB'08)}}, isbn = {{9783540691334}}, issn = {{0302-9743}}, pages = {{447----456}}, title = {{{Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem}}}, doi = {{10.1007/978-3-540-69134-1_44}}, volume = {{5040}}, year = {{2008}}, } @inproceedings{20368, abstract = {{We present a comparative study of two spatially resolved macroscopic models of an autonomous robotic swarm. In previous experiments, the collective behavior of 15 autonomous swarm robots, driven by a simple bio-inspired control algorithm, was investigated: in two different environmental conditions, the ability of the robots to aggregate below a light source was tested. Distinct approaches to predict the dynamics of the spatial distribution were made by two different modeling approaches: one model was constructed in a compartmental manner (ODEs). In parallel, a space-continuous model (PDEs) was constructed. Both models show a high degree of similarity concerning the modeling of concrete environmental factors (light), but due to their different basic approaches, show also significant differences in their implementation. However, the predictions of both models compare well to the observed behavior of the robotic swarm, thus both models can be used to develop further extensions of the algorithm as well as different experimental setups without the need to run extensive real robotic preliminary experiments.}}, author = {{Hamann, Heiko and Schmickl, Thomas and Wörn, Heinz and Crailsheim, Karl}}, booktitle = {{IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS'08)}}, pages = {{1415----1420}}, publisher = {{IEEE Press}}, title = {{{Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm}}}, doi = {{10.1109/IROS.2008.4651038}}, year = {{2008}}, } @article{20369, abstract = {{Designing and analyzing self-organizing systems such as robotic swarms is a challenging task even though we have complete knowledge about the robot’s interior. It is difficult to determine the individual robot’s behavior based on the swarm behavior and vice versa due to the high number of agent–agent interactions. A step towards a solution of this problem is the development of appropriate models which accurately predict the swarm behavior based on a specified control algorithm. Such models would reduce the necessary number of time-consuming simulations and experiments during the design process of an algorithm. In this paper we propose a model with focus on an explicit representation of space because the effectiveness of many swarm robotic scenarios depends on spatial inhomogeneity. We use methods of statistical physics to address spatiality. Starting from a description of a single robot we derive an abstract model of swarm motion. The model is then extended to a generic model framework of communicating robots. In two examples we validate models against simulation results. Our experience shows that qualitative correctness is easily achieved, while quantitative correctness is disproportionately more difficult but still possible.}}, author = {{Hamann, Heiko and Wörn, Heinz}}, issn = {{1935-3812}}, journal = {{Swarm Intelligence}}, number = {{2-4}}, pages = {{209--239}}, title = {{{A framework of space–time continuous models for algorithm design in swarm robotics}}}, doi = {{10.1007/s11721-008-0015-3}}, volume = {{2}}, year = {{2008}}, } @inbook{20711, author = {{Monien, Burkhard and Lorenz, Ulf and Warner, Daniel}}, booktitle = {{Taschenbuch der Algorithmen}}, isbn = {{9783540763932}}, title = {{{Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?}}}, doi = {{10.1007/978-3-540-76394-9_28}}, year = {{2008}}, } @inbook{17978, author = {{Lürwer-Brüggemeier, Katharina and Ziegler, Martin}}, booktitle = {{Unconventional Computing}}, isbn = {{9783540851936}}, issn = {{0302-9743}}, title = {{{On Faster Integer Calculations Using Non-arithmetic Primitives}}}, doi = {{10.1007/978-3-540-85194-3_11}}, year = {{2008}}, }