TY  - BOOK
A1  - Calame, Jens R.
T1  - Considerations on object oriented software testing
T3  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2003
SN  - 0946-7580
VL  - 2003, 4
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - BOOK
A1  - Meyer, Harald
A1  - Kulisch, Marian
T1  - Ein experimenteller Vergleich objekt-orientierter und funktionaler Analysetechniken
T3  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2003
SN  - 0946-7580
VL  - 2003, 6
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - THES
A1  - Otscheretnij, Vitalij
T1  - Entwurf von fehlertoleranten kompinatorischen Schaltungen
Y1  - 2003
ER  - 
TY  - BOOK
A1  - Dietze, Stefan
T1  - Formalisierte Darstellung generalisierter Softwareentwicklungsprozesse im Kontext von Open Source Software
T3  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2003
SN  - 0946-7580
VL  - 2003, 9
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Graphs and colorings for answer set programming : abridged report
Y1  - 2003
UR  - http://www.cs.uni-potsdam.de/wv/pdfformat/kolisch03a.pdf
SN  - 1613-0073
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Schaub, Torsten H.
A1  - Linke, Thomas
T1  - Graphs and colorings for answer set programming with preferences
N2  - The integration of preferences into answer set programming constitutes an important practical device for distinguishing certain preferred answer sets from non-preferred ones. To this end, we elaborate upon rule dependency graphs and their colorings for characterizing different preference handling strategies found in the literature. We start from a characterization of (three types of) preferred answer sets in terms of totally colored dependency graphs. In particular, we demonstrate that this approach allows us to capture all three approaches to preferences in a uniform setting by means of the concept of a height function. In turn, we exemplarily develop an operational characterization of preferred answer sets in terms of operators on partial colorings for one particular strategy. In analogy to the notion of a derivation in proof theory, our operational characterization is expressed as a (non-deterministically formed) sequence of colorings, gradually turning an uncolored graph into a totally colored one
Y1  - 2003
SN  - 0169-2968
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Schaub, Torsten H.
A1  - Linke, Thomas
T1  - Graphs and colorings for answer set programming with prefernces : preliminary report
Y1  - 2003
UR  - http://www.cs.uni-potsdam.de/wv/pdfformat/koschli03a.pdf
SN  - 1613-0073
ER  - 
TY  - JOUR
A1  - Feider, Henryk
A1  - Schnor, Bettina
A1  - Dramlitsch, Thomas
T1  - Gridmake : the missing link for compilation in the Grid
N2  - In order to take full advantage of Grid environments, applications need to be able to run on various heterogeneous platforms. Distributed runs across several clusters or supercomputers for example, require matching binaries at each site. Thus, at some stage, each Grid enabled application needs to be recompiled for every platform. Up to now, creating matching binaries on different platforms was a manual, sequential, slow, and very error-prone process. Developers had to log into each machine, transfer source code, check consistency and recompile if necessary. This cumbersome procedure is surely one reason for the (still existing) lack of production Grid computing. Gridmake, a tool to automate and speed up this procedure is presented in this paper.
Y1  - 2003
ER  - 
TY  - BOOK
ED  - Schwill, Andreas
T1  - Grundfragen multimedialer Lehre : Tagungsband des 1. Workshops GML2003 10. - 11. März 2003 an der Universität Potsdam
Y1  - 2003
SN  - 3-8330-0761-3
PB  - Univ. Lehrstuhl für Didaktik der Informatik
CY  - Potsdam
ER  - 
TY  - BOOK
A1  - Zendler, Andreas
A1  - Steipe, Boris
T1  - Integrationstechnologien für die life science-informatik (State-of-the-art-report)
T3  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 2003
SN  - 0946-7580
VL  - 2003, 2
PB  - Univ.
CY  - Potsdam
ER  -