44 research outputs found

    Jahresbericht 1983. Institut fuer angewandte Informatik und formale Beschreibungsverfahren, Universitaet Karlsruhe

    No full text
    SIGLETIB: RN 3492 (139) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

    Universitaet Karlsruhe (T.H.), Institut fuer Angewandte Informatik und Formale Beschreibungsverfahren (AIFB). Jahresbericht '98

    No full text
    Available from TIB Hannover / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

    A comparison of two approaches to model-based knowledge acquisition

    No full text
    This paper discusses and compares two different approaches to model-based knowledge acquisition. That is, we regard the Model-based and Incremental Knowledge Engineering (MIKE) approach and the Configurable Role-limiting Method approach (CRLM). MIKE is based on the distinction of different phases in the software development process. It uses the formal and operational knowledge specification language KARL allowing a precise and unique description of a model of expertise which is the outcome of the analysis phase. CRLM is based on the role-limiting method approach. Role limiting shells are implementations of strong problem-solving methods and substantially simplify knowledge acquisition through guidance by predefined models of problem-solving and by sophisticated graphical user interfaces. The main disadvantages, namely inflexibility and brittleness, are to some degree overcome by the CRLM where the shell's problem-solving methods are split into smaller parts, which can then be reconfigured allowing the integration of new methods or other method combinations. Although these two approaches are often discussed as contradictory, we, however, experienced that both approaches complete each other very well. As an outcome of our comparison, we outline topics of future research for both approaches. (orig.)Available from TIB Hannover: RN 3492(306) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

    Geometrische Probleme beim VLSI-Design

    No full text
    TIB: RN 3492 (138) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

    Ein flexibles Fertigungssystem fuer Progamme zur Datenkomprimierung

    No full text
    SIGLETIB: RN 3492 (140) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

    Conceptual modelling based on net refinements

    No full text
    SIGLETIB: RN 3492 (142) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

    The information system portfolio

    No full text
    SIGLEAvailable from TIB Hannover: RN 3492(201) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

    Assumptions and limitations of a problem-solving method: a case study

    No full text
    The paper attempts a step in the direction of competence theories of reusable problem-solving methods (psm's). In fact, we examine a variant of the psm propose-and-revise. The variant was developed as a solution to the current Sisyphus task (VT-task). We decompose the entire method into its individual subtasks and examine each subtask for its underlying assumptions concerning the available domain knowledge. By doing this, we determine assumptions and limitations of the entire method. In addition, we examine how different control flows between these subtasks can influence the efficiency and effectiveness of the method. Again, we show how these differences are related to the assumptions of the method. Making these assumptions explicit defines interesting goals for validation and verification efforts. First, we show that under some circumstances two psm's behave equally well or that one is more suitable than another. Second, we have to prove for a given domain knowledge whether it fulfils the assumptions of a selected problem-solving method. We believe that such studies are necessary to allow the reuse of psm's and, conversely, that the reuse of psm's justifies the effort of such activities. (orig.)Available from TIB Hannover: RN 3492(312) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

    Fehlertoleranz und Testbarkeit von VLSI-Algorithmen Abschlussbericht

    No full text
    In this final report on the research project ''Fault Tolerance and Testability of VLSI Algorithms'' we present a survey of our main activities and of the various results obtained. The project got financial support from the Deutsche Forschungsgemeinschaft (DFG) from 1987 to 1992. The main emphasis of the project was on high level cell-based fault models, on using structural properties of VLSI-algorithms to achieve good testability and a large degree of fault tolerance, and on the design and implementation of a fault tolerant and reconfigurable instruction of systolic arrayAvailable from TIB Hannover: RN 3492(253) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDeutsche Forschungsgemeinschaft (DFG), Bonn (Germany)DEGerman

    Supersequences, runs, and CD grammar systems

    No full text
    The Minimal Run Supersequence problem (MinRS) is the decision version of the problem to find for a given finite set L of strings over an alphabet #SIGMA# and integer #kappa# a supersequence of L which has at most #kappa# runs. It is shown that MinRS is polynomial time solvable over an alphabet of size 2 and NP-complete over an alphabet of size 3. Moreover, we study the algorithmic complexity of some related problems concerning supersequences with a maximal number of runs and supersequences into which the strings in L can be embedded disjointly. Applications of the derived results to production planning and scheduling theory are given. We then demonstrate that supersequence problems are a useful tool for investigating the complexity of the Membership problem for grammar systems. As a first example we give a simple proof for the known fact that the Membership problem for ETOL systems is NP-complete. Then, we give results about the Membership problem for CD grammar systems. In particular, we are concerned here with CD grammar systems with two components and where derivations are done in an alternating way. (orig.)Available from TIB Hannover: RN 3492(275) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman
    corecore