CoaSt
 |
Komplexität und Struktur |
|
Kontaktperson: k.A. |
Complex systems and complex problems appear in all areas of applicationin business and science. It is the aim of this project to contribute tosolutions to the following questions:
What causes the high computational complexity of algorithmic problems and the complex dynamic behaviour of systems?How complexity of algorithmic problems can be influenced by structure and parameters of input objects?How should should applications and systems be designed to become manageable?Which organizational structures and parmeters influence complexity of business proceses?How IT can support management of business processes?
We try to consider all facets of complexity, reaching from computational and dynamic aspects to questions of management. Main areas of application are finance, risk management, financial markets, management of business processes, electronic commerce, market engineering and software engineering.
bis: k.A.
partially supported by cirquent GmbH, partially supported by GILLARDON AG financial software
Geschäftsprozessmanagement, Effiziente Algorithmen, Beschreibende Komplexitätstheorie, Graphentheorie, Theoretische Informatik, Parametrische Komplexitätstheorie, Endliche Modelltheorie, Algorithmische Graphentheorie, Komplexitätstheorie, Logik CoaSt (Effiziente Algorithmen, Endliche Modelltheorie, Komplexitätstheorie, Logik, Parametrische Komplexitätstheorie, Theoretische Informatik, Algorithmische Graphentheorie, Graphentheorie, Beschreibende Komplexitätstheorie, Geschäftsprozessmanagement)
article
Alexander Maedche, Boris Motik, Ljiljana Stojanovic, Rudi Studer, Raphael Volz
Ontologies for Enterprise Knowledge Management
IEEE Intelligent Systems, November, 2002
(Details)
↑ topinproceedings
N. Parameswaran, L. Lewis, Detlef Seese, P. Ray
DISDM: Distributed Intelligent System for Disaster Management - An Architectural Proposal
Proceedings of the 5th International Symposium on Crisis Response and Alert Management (ISCRAM2008), Washington DC, USA, May 4 - 7 2008, Seiten: 1 - 8
(Details)
Petr Hlineny, Detlef Seese
On decidability of MSO theories of representable matroids
In Rod Downey, Michael Fellows, Frank Dehne, Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14 - 17, 2004, Proceedings, Seiten: 96 - 107, Springer-Verlag Berlin, Heidelberg, Lecture Notes in computer Science
(Details)
Detlef Seese, Frank Schlottmann
Large grids and local information flow as a reason for high complexity
In Frizelle, Gerry; Richards, Huw (eds.), Tackling industrial complexity: the ideas that make a difference, Proceedings of the 2002 Conference of the Manufacturing Complexity Network, April 9-10 2002, University of Cambridge, Seiten: 193-207, -
(Details)
↑ top