655 uppsatser · sida 8 av 44
En undersökning av Dublin Cores överensstämmelse med FRBR
… cataloging and full text indexing, and by discussing the possibilities to extend Dublin Core, this study finds that deficient correspondence to FRBR is inevitable if the simplicity of Dublin Core is to be preserved.
… of the school librarian and of her/his qualifications and they all desire an extended collaboration. But the level of collaboration with the school librarian is due to the collaborative cultures that prevail in the particular school, confusion of roles and insufficient planning …
… The methodological onset is based on hermeneutical concepts that allow an extended analysis of abstract structures of thought. This analysis comprises of two parts; a descriptive analysis and a comparative analysis. The result of the descriptive analysis, whose aim is to …
A Critical Investigation from an Ethical Perspective
… which I attempt to unravel in this work deals with the question to what extend the application of intellectual property rights in software is necessary and how restrictive particular property rights in digital objects should be - if there should be any at all. Knowledge as the …
… involved in product development projects in different ways and to different extends. The involvement is carried out in two main ways; either by planned meetings, demanded direct involvement, or by market and sales departments, not demanded involvement. The characteristics of the …
… of the taxonomy in certain domains in aviation. To be able to test the extended taxonomy we have developed a system support that consists of a database and help functions consisting of checklists and linked regulation text. The system support also contains risk assessment …
… consisting of a poppet valve and a two stage cooler. The model will be used to extend an existing mean value engine model. Two models of different complexity for the EGR system have been validated with sufficient accuracy. Validation was performed during static test bed …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
Vattenfall Eldistribution AB
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape …
