8 Search Results for "Müller, Rolf"

Document
DOI: 10.4230/DagSemProc.10071.7
Optimal Mechanisms for Scheduling

Authors: Birgit Heydenreich, Debasis Mishra, Rudolf Müller, and Marc Uetz

Published in: Dagstuhl Seminar Proceedings, Volume 10071, Scheduling (2010)

Abstract
We study the design of optimal mechanisms in a setting where a service provider needs to schedule a set of non-preemptive jobs, one job at a time. Jobs need to be compensated for waiting, and waiting cost is private information. In this setting, an optimal mechanism is one that induces jobs to report truthfully their waiting cost, while minimizing the total expected compensation cost of the service provider. Here, truthful refers to Bayes-Nash implementability, and assumes that private information is independently drawn from known distributions. We derive closed formulae for the optimal mechanism, and show that it is a modification of Smith’s ratio rule. We also show that it can be implemented in dominant strategies. Our analysis relies on a graph-theoretic interpretation of the incentive compatibility constraints. It parallels the analysis known for auctions with single parameter agents, yet it exhibits some subtle differences. We also consider the multi-dimensional case where also the service times of jobs are private information. We show that for this problem the optimal mechanism generally does not satisfy an independence condition known as IIA, and thus known approaches are doomed to fail.
Cite as

Birgit Heydenreich, Debasis Mishra, Rudolf Müller, and Marc Uetz. Optimal Mechanisms for Scheduling. In Scheduling. Dagstuhl Seminar Proceedings, Volume 10071, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{heydenreich_et_al:DagSemProc.10071.7,
  author =	{Heydenreich, Birgit and Mishra, Debasis and M\"{u}ller, Rudolf and Uetz, Marc},
  title =	{{Optimal Mechanisms for Scheduling}},
  booktitle =	{Scheduling},
  pages =	{1--22},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10071},
  editor =	{Susanne Albers and Sanjoy K. Baruah and Rolf H. M\"{o}hring and Kirk Pruhs},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10071.7},
  URN =		{urn:nbn:de:0030-drops-25401},
  doi =		{10.4230/DagSemProc.10071.7},
  annote =	{Keywords: Optimal Mechanism Design, Scheduling, Job Agents, Smith's Rule}
}
Document
DOI: 10.4230/DagSemProc.09461.4
Solving hard instances in QF-BV combining Boolean reasoning with computer algebra

Authors: Markus Wedler, Evgeny Pavlenko, Alexander Dreyer, Frank Seelisch, Dominik Stoffel, Gert-Martin Greuel, and Wolfgang Kunz

Published in: Dagstuhl Seminar Proceedings, Volume 9461, Algorithms and Applications for Next Generation SAT Solvers (2010)

Abstract
This paper describes our new satisfyability (SAT) modulo theory (SMT) solver STABLE for the quantifier-free logic over fixed size bit vectors. Our main application domain is formal verification of system-on-chip (SoC) modules designed for complex computational tasks, for example, in signal processing applications. Ensuring proper functional behavior for such modules, including arithmetic correctness of the data paths, is considered a very difficult problem. We show how methods from computer algebra can be integrated into an SMT solver such that instances can be handled where the arithmetic problem parts are specified mixing various levels of abstraction from the plain gate level for small highly optimized components up to the pure word level used in high-level specifications. If the arithmetic problem parts include multiplications such mixed problem descriptions quickly drive current SMT solvers towards their capacity limits. High performance data paths are often designed at a level of abstraction that we call the arithmetic bit level (ABL). We show how ABL information, if available in an SMT instance, can be used to transform the decision problem into an equivalent set of variety subset problems. These problems can be solved efficiently with techniques from computer algebra based on Gröbner basis theory over finite rings Z/2^n . Sometimes, instances contain problem parts at a level below the ABL using gate-level operations. These problem parts, e.g., originate from custom-designed arithmetic components that are highly optimized using the gate-level constructs of a hardware description language (HDL). For such cases we integrate a local ABL extraction technique based on local Reed-Muller forms.
Cite as

Markus Wedler, Evgeny Pavlenko, Alexander Dreyer, Frank Seelisch, Dominik Stoffel, Gert-Martin Greuel, and Wolfgang Kunz. Solving hard instances in QF-BV combining Boolean reasoning with computer algebra. In Algorithms and Applications for Next Generation SAT Solvers. Dagstuhl Seminar Proceedings, Volume 9461, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{wedler_et_al:DagSemProc.09461.4,
  author =	{Wedler, Markus and Pavlenko, Evgeny and Dreyer, Alexander and Seelisch, Frank and Stoffel, Dominik and Greuel, Gert-Martin and Kunz, Wolfgang},
  title =	{{Solving hard instances in QF-BV combining Boolean reasoning with computer algebra}},
  booktitle =	{Algorithms and Applications for Next Generation SAT Solvers},
  pages =	{1--20},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9461},
  editor =	{Bernd Becker and Valeria Bertacoo and Rolf Drechsler and Masahiro Fujita},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09461.4},
  URN =		{urn:nbn:de:0030-drops-25096},
  doi =		{10.4230/DagSemProc.09461.4},
  annote =	{Keywords: SAT modulo Theory, Quantifier Free logic over fixed sized bitvectors; Computer Algebra}
}
Document
DOI: 10.4230/DagSemProc.08141.1
08141 Abstracts Collection – Organic Computing - Controlled Self-organization

Authors: Kirstie Bellman, Mike Hinchey, Christian Müller-Schloer, Hartmut Schmeck, and Rolf Würtz

Published in: Dagstuhl Seminar Proceedings, Volume 8141, Organic Computing - Controlled Self-organization (2008)

Abstract
From March 30th to April 4th 2008, the Dagstuhl Seminar 08141 "Organic Computing - Controlled Self-organization"' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Kirstie Bellman, Mike Hinchey, Christian Müller-Schloer, Hartmut Schmeck, and Rolf Würtz. 08141 Abstracts Collection – Organic Computing - Controlled Self-organization. In Organic Computing - Controlled Self-organization. Dagstuhl Seminar Proceedings, Volume 8141, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{bellman_et_al:DagSemProc.08141.1,
  author =	{Bellman, Kirstie and Hinchey, Mike and M\"{u}ller-Schloer, Christian and Schmeck, Hartmut and W\"{u}rtz, Rolf},
  title =	{{08141 Abstracts Collection – Organic Computing - Controlled Self-organization}},
  booktitle =	{Organic Computing - Controlled Self-organization},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8141},
  editor =	{Kirstie Bellman and Michael G. Hinchey and Christian M\"{u}ller-Schloer and Hartmut Schmeck and Rolf W\"{u}rtz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08141.1},
  URN =		{urn:nbn:de:0030-drops-15675},
  doi =		{10.4230/DagSemProc.08141.1},
  annote =	{Keywords: Organic computing, self-organisation, design, adaptivity}
}
Document
DOI: 10.4230/DagSemProc.08141.2
08141 Executive Summary – Organic Computing - Controlled Self-organization

Authors: Kirstie Bellman, Mike Hinchey, Christian Müller-Schloer, Hartmut Schmeck, and Rolf Würtz

Published in: Dagstuhl Seminar Proceedings, Volume 8141, Organic Computing - Controlled Self-organization (2008)

Abstract
Organic Computing (OC) has become a challenging vision for the design of future information processing systems: As they become increasingly powerful, cheaper and smaller, our environment will be filled with collections of autonomous systems equipped with sensors and actuators to be aware of their environment, to communicate, and to organize themselves in order to perform the actions and servic-es that seem to be required. However, due to increasing complexity we will not be able to explicitly design and manage all intelligent components of a digitally enhanced environment in every detail and anticipate every possible configuration. Therefore, our technical systems will have to act more independently, flexibly, and autonomously, i.e., they will have to exhibit life-like properties. We call such systems "organic". Hence, an "Organic Computing System" is a technical system, which adapts dynamically to the current conditions of its environment. It will be self-organizing, self-configuring, self-healing, self-protecting, self-explaining, and context-aware.
Cite as

Kirstie Bellman, Mike Hinchey, Christian Müller-Schloer, Hartmut Schmeck, and Rolf Würtz. 08141 Executive Summary – Organic Computing - Controlled Self-organization. In Organic Computing - Controlled Self-organization. Dagstuhl Seminar Proceedings, Volume 8141, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{bellman_et_al:DagSemProc.08141.2,
  author =	{Bellman, Kirstie and Hinchey, Mike and M\"{u}ller-Schloer, Christian and Schmeck, Hartmut and W\"{u}rtz, Rolf},
  title =	{{08141 Executive Summary – Organic Computing - Controlled Self-organization}},
  booktitle =	{Organic Computing - Controlled Self-organization},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8141},
  editor =	{Kirstie Bellman and Michael G. Hinchey and Christian M\"{u}ller-Schloer and Hartmut Schmeck and Rolf W\"{u}rtz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08141.2},
  URN =		{urn:nbn:de:0030-drops-15660},
  doi =		{10.4230/DagSemProc.08141.2},
  annote =	{Keywords: Organic Computing}
}
Document
DOI: 10.4230/OASIcs.ATMOS.2005.657
Paying Less for Train Connections with MOTIS

Authors: Matthias Müller-Hannemann and Mathias Schnee

Published in: OASIcs, Volume 2, 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05) (2006)

Abstract
Finding cheap train connections for long-distance traffic is algorithmically a hard task due to very complex tariff regulations. Several new tariff options have been developed in recent years, partly to react on the stronger competition with low-cost airline carriers. In such an environment, it becomes more and more important that search engines for travel connections are able to find special offers efficiently. We have developed a multi-objective traffic information system (MOTIS) which finds all attractive train connections with respect to travel time, number of interchanges, and ticket costs. In contrast, most servers for timetable information as well as the theoretical literature on this subject focus only on travel time as the primary objective, and secondary objectives like the number of interchanges are treated only heuristically. The purpose of this paper is to show by means of a case study how several of the most common tariff rules (including special offers) can be embedded into a general multi-objective search tool. Computational results show that a multi-objective search with a mixture of tariff rules can be done almost as fast as just with one regular tariff. For the train schedule of Germany, a query can be answered within 1.9s on average on a standard PC.
Cite as

Matthias Müller-Hannemann and Mathias Schnee. Paying Less for Train Connections with MOTIS. In 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05). Open Access Series in Informatics (OASIcs), Volume 2, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{mullerhannemann_et_al:OASIcs.ATMOS.2005.657,
  author =	{M\"{u}ller-Hannemann, Matthias and Schnee, Mathias},
  title =	{{Paying Less for Train Connections with MOTIS}},
  booktitle =	{5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)},
  pages =	{1--19},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-00-2},
  ISSN =	{2190-6807},
  year =	{2006},
  volume =	{2},
  editor =	{Kroon, Leo G. and M\"{o}hring, Rolf H.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2005.657},
  URN =		{urn:nbn:de:0030-drops-6572},
  doi =		{10.4230/OASIcs.ATMOS.2005.657},
  annote =	{Keywords: Timetable information system, multi-criteria optimization, shortest paths, fares, special offers, long-distance traffic}
}
Document
DOI: 10.4230/DagSemProc.06031.1
06031 Abstracts Collection – Organic Computing – Controlled Emergence

Authors: Kirstie Bellman, Peter Hofmann, Christian Müller-Schloer, Hartmut Schmeck, and Rolf P. Würtz

Published in: Dagstuhl Seminar Proceedings, Volume 6031, Organic Computing - Controlled Emergence (2006)

Abstract
Organic Computing has emerged recently as a challenging vision for future information processing systems, based on the insight that we will soon be surrounded by large collections of autonomous systems equipped with sensors and actuators to be aware of their environment, to communicate freely, and to organize themselves in order to perform the actions and services required. Organic Computing Systems will adapt dynamically to the current conditions of its environment, they will be self-organizing, self-configuring, self-healing, self-protecting, self-explaining, and context-aware. From 15.01.06 to 20.01.06, the Dagstuhl Seminar 06031 ``Organic Computing – Controlled Emergence'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. The seminar was characterized by the very constructive search for common ground between engineering and natural sciences, between informatics on the one hand and biology, neuroscience, and chemistry on the other. The common denominator was the objective to build practically usable self-organizing and emergent systems or their components. An indicator for the practical orientation of the seminar was the large number of OC application systems, envisioned or already under implementation, such as the Internet, robotics, wireless sensor networks, traffic control, computer vision, organic systems on chip, an adaptive and self-organizing room with intelligent sensors or reconfigurable guiding systems for smart office buildings. The application orientation was also apparent by the large number of methods and tools presented during the seminar, which might be used as building blocks for OC systems, such as an evolutionary design methodology, OC architectures, especially several implementations of observer/controller structures, measures and measurement tools for emergence and complexity, assertion-based methods to control self-organization, wrappings, a software methodology to build reflective systems, and components for OC middleware. Organic Computing is clearly oriented towards applications but is augmented at the same time by more theoretical bio-inspired and nature-inspired work, such as chemical computing, theory of complex systems and non-linear dynamics, control mechanisms in insect swarms, homeostatic mechanisms in the brain, a quantitative approach to robustness, abstraction and instantiation as a central metaphor for understanding complex systems. Compared to its beginnings, Organic Computing is coming of age. The OC vision is increasingly padded with meaningful applications and usable tools, but the path towards full OC systems is still complex. There is progress in a more scientific understanding of emergent processes. In the future, we must understand more clearly how to open the configuration space of technical systems for on-line modification. Finally, we must make sure that the human user remains in full control while allowing the systems to optimize.
Cite as

Kirstie Bellman, Peter Hofmann, Christian Müller-Schloer, Hartmut Schmeck, and Rolf P. Würtz. 06031 Abstracts Collection – Organic Computing – Controlled Emergence. In Organic Computing - Controlled Emergence. Dagstuhl Seminar Proceedings, Volume 6031, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{bellman_et_al:DagSemProc.06031.1,
  author =	{Bellman, Kirstie and Hofmann, Peter and M\"{u}ller-Schloer, Christian and Schmeck, Hartmut and W\"{u}rtz, Rolf P.},
  title =	{{06031 Abstracts Collection – Organic Computing – Controlled Emergence}},
  booktitle =	{Organic Computing - Controlled Emergence},
  pages =	{1--19},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6031},
  editor =	{Kirstie Bellman and Peter Hofmann and Christian M\"{u}ller-Schloer and Hartmut Schmeck and Rolf W\"{u}rtz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06031.1},
  URN =		{urn:nbn:de:0030-drops-5777},
  doi =		{10.4230/DagSemProc.06031.1},
  annote =	{Keywords: Emergence, self-organization, self-configuration, self-healing, self-protection, self-explaining, context-awareness}
}
Document
DOI: 10.4230/DagSemProc.06031.2
06031 Executive Summary – Organic Computing – Controlled Emergence

Authors: Kirstie Bellman, Peter Hofmann, Christian Müller-Schloer, Hartmut Schmeck, and Rolf P. Würtz

Published in: Dagstuhl Seminar Proceedings, Volume 6031, Organic Computing - Controlled Emergence (2006)

Abstract
Organic Computing has emerged recently as a challenging vision for future information processing systems, based on the insight that we will soon be surrounded by systems with massive numbers of processing elements, sensors and actuators, many of which will be autonomous. Because of the size of these systems it is infeasible for us to monitor and control them entirely from external observations; instead they will need to help us monitor, control and adapt themselves. To do so, these components will need to be aware of their environment, to communicate freely, and to organize themselves in order to perform the actions and services that are required. The presence of networks of intelligent systems in our environment opens up fascinating application areas but, at the same time, bears the problem of their controllability. Hence, we have to construct these systems which we increasingly depend on as robust, safe, flexible, and trustworthy as possible. In particular, a strong orientation towards human needs as opposed to a pure implementation of the technologically possible seems absolutely central. In order to achieve these goals, our technical systems will have to act more independently, flexibly, and autonomously, i.e., they will have to exhibit lifelike properties. We call those systems ''organic''. Hence, an ''Organic Computing System'' is a technical system which adapts dynamically to the current conditions of its environment. It will be selforganizing, selfconfiguring, selfhealing, selfprotecting, selfexplaining, and context-aware.
Cite as

Kirstie Bellman, Peter Hofmann, Christian Müller-Schloer, Hartmut Schmeck, and Rolf P. Würtz. 06031 Executive Summary – Organic Computing – Controlled Emergence. In Organic Computing - Controlled Emergence. Dagstuhl Seminar Proceedings, Volume 6031, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{bellman_et_al:DagSemProc.06031.2,
  author =	{Bellman, Kirstie and Hofmann, Peter and M\"{u}ller-Schloer, Christian and Schmeck, Hartmut and W\"{u}rtz, Rolf P.},
  title =	{{06031 Executive Summary – Organic Computing – Controlled Emergence}},
  booktitle =	{Organic Computing - Controlled Emergence},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6031},
  editor =	{Kirstie Bellman and Peter Hofmann and Christian M\"{u}ller-Schloer and Hartmut Schmeck and Rolf W\"{u}rtz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06031.2},
  URN =		{urn:nbn:de:0030-drops-5788},
  doi =		{10.4230/DagSemProc.06031.2},
  annote =	{Keywords: Emergence, self-organization, self-configuration, self-healing, self-protection, self-explaining, context-awareness}
}
Document
DOI: 10.4230/DagSemProc.05471.11
MULTIDIMENSIONAL PEPTIDE/PROTEIN ANALYSIS AND IDENTIFICATION BY SEQUENCE DATABASE SEARCH USING MASS SPECTROMETRIC DATA

Authors: Christian Schley, Matthias Altmeyer, Rolf Müller, and Christian G. Huber

Published in: Dagstuhl Seminar Proceedings, Volume 5471, Computational Proteomics (2006)

Abstract
In order to generate proteomics data that are suitable to validate protein identification in complex mixtures using multidimensional liquid-chromatography-mass spectrometry approaches, we implemented an offline two-dimensional liquid chromatography method combining strong cation-exchange- and ion-pair reversed-phase chromatography followed by electrospray ionization tandem mass spectrormetry (ESI-MS/MS) for the analysis of a bovine serum albumin digest. The fragment ion spectra generated by ESI-MS/MS were subsequently analyzed via MASCOT database search. The obtained identification data were evaluated in terms of quality of protein/peptide identification by means of score values, reproducibility of identification in replicate measurements, distribution of tryptic peptides among different fractions, and overall number of unique identified proteins/peptides. Finally, we improved the trapping conditions in the second dimension by using a more hydrophobic amphiphile in the loading buffer. The improvement was demonstrated by comparison of the obtained identification data, such as number of identified peptides, cumulative mowse scores and reproducibility of identification.
Cite as

Christian Schley, Matthias Altmeyer, Rolf Müller, and Christian G. Huber. MULTIDIMENSIONAL PEPTIDE/PROTEIN ANALYSIS AND IDENTIFICATION BY SEQUENCE DATABASE SEARCH USING MASS SPECTROMETRIC DATA. In Computational Proteomics. Dagstuhl Seminar Proceedings, Volume 5471, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{schley_et_al:DagSemProc.05471.11,
  author =	{Schley, Christian and Altmeyer, Matthias and M\"{u}ller, Rolf and Huber, Christian G.},
  title =	{{MULTIDIMENSIONAL PEPTIDE/PROTEIN ANALYSIS AND IDENTIFICATION BY SEQUENCE DATABASE SEARCH USING MASS SPECTROMETRIC DATA}},
  booktitle =	{Computational Proteomics},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5471},
  editor =	{Christian G. Huber and Oliver Kohlbacher and Knut Reinert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05471.11},
  URN =		{urn:nbn:de:0030-drops-5389},
  doi =		{10.4230/DagSemProc.05471.11},
  annote =	{Keywords: Multidimensional chromatography, proteome analysis, monolithic column, tandem mass spectrometry}
}
  • Refine by Author
  • 4 Bellman, Kirstie
  • 4 Müller-Schloer, Christian
  • 4 Schmeck, Hartmut
  • 2 Hinchey, Mike
  • 2 Hofmann, Peter
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 2 Emergence
  • 2 context-awareness
  • 2 self-configuration
  • 2 self-explaining
  • 2 self-healing
  • Show More...

  • Refine by Type
  • 8 document

  • Refine by Publication Year
  • 4 2006
  • 2 2008
  • 2 2010

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact