5 Search Results for "Kowalczyk, Michael"

Document
DOI: 10.4230/LIPIcs.ITCS.2018.2
A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory

Authors: Jin-Yi Cai, Zhiguo Fu, Kurt Girstmair, and Michael Kowalczyk

Published in: LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)

Abstract
Suppose \varphi and \psi are two angles satisfying \tan(\varphi) = 2 \tan(\psi) > 0. We prove that under this condition \varphi and \psi cannot be both rational multiples of \pi. We use this number theoretic result to prove a classification of the computational complexity of spin systems on k-regular graphs with general (not necessarily symmetric) real valued edge weights. We establish explicit criteria, according to which the partition functions of all such systems are classified into three classes: (1) Polynomial time computable, (2) \#P-hard in general but polynomial time computable on planar graphs, and (3) \#P-hard on planar graphs. In particular problems in (2) are precisely those that can be transformed to a form solvable by the Fisher-Kasteleyn-Temperley algorithm by a holographic reduction.
Cite as

Jin-Yi Cai, Zhiguo Fu, Kurt Girstmair, and Michael Kowalczyk. A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 2:1-2:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{cai_et_al:LIPIcs.ITCS.2018.2,
  author =	{Cai, Jin-Yi and Fu, Zhiguo and Girstmair, Kurt and Kowalczyk, Michael},
  title =	{{A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory}},
  booktitle =	{9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
  pages =	{2:1--2:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-060-6},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{94},
  editor =	{Karlin, Anna R.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.2},
  URN =		{urn:nbn:de:0030-drops-83251},
  doi =		{10.4230/LIPIcs.ITCS.2018.2},
  annote =	{Keywords: Spin Systems, Holant Problems, Number Theory, Characters, Cyclotomic Fields}
}
Document
DOI: 10.4230/DagRep.4.4.37
Multi-agent systems and their role in future energy grids (Dagstuhl Seminar 14181)

Authors: Michael N. Huhns, Wolfgang Ketter, Ryszard Kowalczyk, Fabrice Saffre, and Rainer Unland

Published in: Dagstuhl Reports, Volume 4, Issue 4 (2014)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14181 "Multi-agent systems and their role in future energy grids". A number of recent events (e.g. Fukushima, Japan, and the largest blackout in history, India) have once again increased global attention on climate change and resource depletion. The evaluation of the feasibility of current approaches for future energy generation, distribution, transportation, and consumption has become an important requirement for most countries. There is a general consensus on the need for a fundamental transformation of future energy grids. The development of an information and communication technology (ICT) support infrastructure was identified as the key challenge in the design of an end-to-end smart grid. A multiagent system, with agents located at the edges and nodes of the grid and representing the interests of end-users, distributors, and providers, enables intelligent decisions to be made at each node in the electric power distribution network (grid). The seminar fostered discussions among experts from all relevant disciplines is to develop the foundation for the necessary interdisciplinary solution from engineering, computer science, and business management. The outcome was an understanding and identification of the requirements on the information systems for future smart grids.
Cite as

Michael N. Huhns, Wolfgang Ketter, Ryszard Kowalczyk, Fabrice Saffre, and Rainer Unland. Multi-agent systems and their role in future energy grids (Dagstuhl Seminar 14181). In Dagstuhl Reports, Volume 4, Issue 4, pp. 37-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@Article{huhns_et_al:DagRep.4.4.37,
  author =	{Huhns, Michael N. and Ketter, Wolfgang and Kowalczyk, Ryszard and Saffre, Fabrice and Unland, Rainer},
  title =	{{Multi-agent systems and their role in future energy grids (Dagstuhl Seminar 14181)}},
  pages =	{37--48},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{4},
  editor =	{Huhns, Michael N. and Ketter, Wolfgang and Kowalczyk, Ryszard and Saffre, Fabrice and Unland, Rainer},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.4.4.37},
  URN =		{urn:nbn:de:0030-drops-46179},
  doi =		{10.4230/DagRep.4.4.37},
  annote =	{Keywords: Multiagent Systems, Demand-Side Management, Smart Grid, Eneregy Distribution}
}
Document
DOI: 10.4230/DagSemProc.10021.5
Programming Service Oriented Agents

Authors: Benjamin Hirsch, Thomas Konnerth, Michael Burkhardt, and Sahin Albayrak

Published in: Dagstuhl Seminar Proceedings, Volume 10021, Service-Oriented Architecture and (Multi-)Agent Systems Technology (2010)

Abstract
This paper introduces a programming language for service-oriented agents. JADL++ combines the ease of use of scripting-languages with a state-of-the-art service oriented approach which allows the seamless integration of web-services. Furthermore, the language includes OWL-based ontologies for semantic descriptions of data and services, thus allowing agents to make intelligent decisions about service calls.
Cite as

Benjamin Hirsch, Thomas Konnerth, Michael Burkhardt, and Sahin Albayrak. Programming Service Oriented Agents. In Service-Oriented Architecture and (Multi-)Agent Systems Technology. Dagstuhl Seminar Proceedings, Volume 10021, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{hirsch_et_al:DagSemProc.10021.5,
  author =	{Hirsch, Benjamin and Konnerth, Thomas and Burkhardt, Michael and Albayrak, Sahin},
  title =	{{Programming Service Oriented Agents}},
  booktitle =	{Service-Oriented Architecture and (Multi-)Agent Systems Technology},
  pages =	{1--16},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10021},
  editor =	{Monique Calisti and Frank P. Dignum and Ryszard Kowalczyk and Frank Leymann and Rainer Unland},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10021.5},
  URN =		{urn:nbn:de:0030-drops-28158},
  doi =		{10.4230/DagSemProc.10021.5},
  annote =	{Keywords: Service oriented architectures, agents, agent programming language, semantic services}
}
Document
DOI: 10.4230/DagSemProc.10021.6
Reliability of Service-Based and Agent-Based Systems

Authors: Michael N. Huhns

Published in: Dagstuhl Seminar Proceedings, Volume 10021, Service-Oriented Architecture and (Multi-)Agent Systems Technology (2010)

Abstract
A description of the current problems of service-oriented architectures and service-oriented computing and how the solutions will come from using agent technology. That is, services will have to become more agent-like in order to succeed fully in the marketplace.
Cite as

Michael N. Huhns. Reliability of Service-Based and Agent-Based Systems. In Service-Oriented Architecture and (Multi-)Agent Systems Technology. Dagstuhl Seminar Proceedings, Volume 10021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{huhns:DagSemProc.10021.6,
  author =	{Huhns, Michael N.},
  title =	{{Reliability of Service-Based and Agent-Based Systems}},
  booktitle =	{Service-Oriented Architecture and (Multi-)Agent Systems Technology},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10021},
  editor =	{Monique Calisti and Frank P. Dignum and Ryszard Kowalczyk and Frank Leymann and Rainer Unland},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10021.6},
  URN =		{urn:nbn:de:0030-drops-25546},
  doi =		{10.4230/DagSemProc.10021.6},
  annote =	{Keywords: Service-oriented computing, multiagent systems}
}
Document
DOI: 10.4230/LIPIcs.STACS.2010.2482
Holant Problems for Regular Graphs with Complex Edge Functions

Authors: Michael Kowalczyk and Jin-Yi Cai

Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)

Abstract
We prove a complexity dichotomy theorem for Holant Problems on $3$-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted Pairs, which allow us to prove that a pair of combinatorial gadgets \emph{in combination} succeed in proving \#P-hardness; and (3) algebraic symmetrization, which significantly lowers the \emph{symbolic complexity} of the proof for computational complexity. With \emph{holographic reductions} the classification theorem also applies to problems beyond the basic model.
Cite as

Michael Kowalczyk and Jin-Yi Cai. Holant Problems for Regular Graphs with Complex Edge Functions. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 525-536, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{kowalczyk_et_al:LIPIcs.STACS.2010.2482,
  author =	{Kowalczyk, Michael and Cai, Jin-Yi},
  title =	{{Holant Problems for Regular Graphs with Complex Edge Functions}},
  booktitle =	{27th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{525--536},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-16-3},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{5},
  editor =	{Marion, Jean-Yves and Schwentick, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2482},
  URN =		{urn:nbn:de:0030-drops-24826},
  doi =		{10.4230/LIPIcs.STACS.2010.2482},
  annote =	{Keywords: Computational complexity}
}
  • Refine by Author
  • 2 Cai, Jin-Yi
  • 2 Huhns, Michael N.
  • 2 Kowalczyk, Michael
  • 1 Albayrak, Sahin
  • 1 Burkhardt, Michael
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 1 Characters
  • 1 Computational complexity
  • 1 Cyclotomic Fields
  • 1 Demand-Side Management
  • 1 Eneregy Distribution
  • Show More...

  • Refine by Type
  • 5 document

  • Refine by Publication Year
  • 3 2010
  • 1 2014
  • 1 2018

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