| |
Tomasz Gubala and
Andreas Hoheisel. Highly Dynamic Workflow Orchestration for Scientific Applications. In CoreGRID Intergation Workshop 2006 (CIW06), Pages 309--320, ACC CYFRONET AGH, 2006. 
Keywords: WP7.
|
|
| |
|
| |
|
| |
Jiri Denemark,
Michal Jankowski,
Krenek Ales,
Luděk Matyska,
Norbert Meyer,
Miroslav Ruda and
Pawel Wolniewicz. Best Practices of User Account Management with Virtual Organization Based Access to Grid. In
Roman Wyrzykowski,
Jack Dongarra,
Norbert Meyer and
Jerzy Wasniewski editors, Parallel Processing and Applied Mathematics, Vol. 3911:633-642 of LNCS, Springer-Verlag, 2006.
Keywords: WP5.
|
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
Artur Andrzejak. Kryptoregulierung (On cryptography debate) In
Thomas Hoeren and
Robert Queck editors, Rechtsfragen der Informationsgesellschaft, Vol. 17:132--145 of Grundlagen und Praxis des Wirtschaftsrechts, Erich-Schmidt-Verlag Berlin, 1999. [Annote]
|
|
| |
Artur Andrzejak. Modeling System Behaviour by Abstract State Machines. In SELF-STAR:~International Workshop on Self-*~Properties in Complex Information Systems, University of Bologna Residental Center Bertinoro, Italy, June 2004.
Note: Presentation. [Annote]
|
|
| |
|
Artur Andrzejak. Memory-Efficient and Fast Enumeration of Global States. In 7th~IEEE~International Conference on Information Visualization IV03-AGT, London, 16 July 2003. [Annote]
|
|
| |
|
| |
|
Artur Andrzejak. An algorithm for the Tutte polynomials of graphs of bounded treewidth. In Discrete Mathematics, Vol. 190:39--54, 1998. [Annote]
|
|
| |
|
Artur Andrzejak. Splitting formulas for tutte polynomials. In Journal of Combinatorial Theory, Vol. 70(2):346--366 of Series B, 1997. [Annote]
|
|
| |
|
| |
Artur Andrzejak and
Mehmet Ceyran. Characterizing and Predicting Resource Demand by Periodicity Mining. In Journal of Network and Systems Management, Special Issue on Self-Managing Systems and Networks, Vol. 13(2), June 2005.
Keywords: WP4. [Annote]
|
|
| |
|
Artur Andrzejak and
Komei Fukuda. Debugging Distributed Computations by Reverse Search. In AI2003, Parallel and Distributed Computing and Networks (PDCN'2003), Innsbruck, 10 February 2003. [Annote]
|
|
| |
|
Artur Andrzejak and
Komei Fukuda. Optimizing over k-set polytypes and efficient k-set enumeration. In Proceedings of the 6th International Workshop on Algorithms and Data Structures (WADS'99), Vol. 1663:1--12 of LNCS, Springer, 1999. [Annote]
|
|
| |
|
| |
|
| |
Artur Andrzejak and
Stefan Plantikow. Defining Fuzzy Logic Controllers with Scarce Model Data. In First International Workshop on Feedback Control Implementation and Design in Computing Systems and Networks FeBID'06 (colocated with NOMS'06), Vancouver, Canada, April 2006.
Keywords: WP4. [Annote]
|
|
| |
|
Artur Andrzejak,
Jerry Rolia and
Martin Arlitt. Bounding the Resource Savings of Several Utility Computing Models for a Data Center. Technical report, HPL Technical Report HPL-2002-339, Hewlett-Packard Laboratories, Palo Alto, USA, December 2002. [Annote]
|
|
| |
|
| |
|
Artur Andrzejak and
Emo Welzl. Halving point sets. In Documenta Mathematica, Extra Volume ICM 98, Proceedings of the International Congress of Mathematicians Berlin, Vol. III:471--471, 1998. [Annote]
|
|
| |
|
| |
|
Artur Andrzejak and
Zhichen Xu. Scalable, Efficient Range Queries for Grid Information Services. In 2nd~IEEE~International Conference on Peer-to-Peer Computing (P2P2002), Link\oping, Sweden, 5 September 2002. [Annote]
|
|
|
