Sökning: "data complexity"
Visar resultat 1 - 5 av 1692 avhandlingar innehållade orden data complexity.
1. Space in Proof Complexity
Sammanfattning : ropositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic. In this thesis we are concerned with the size and space of proofs, and in particular with the latter.Different approaches to reasoning are captured by corresponding proof systems. LÄS MER
2. Lock-free Concurrent Search
Sammanfattning : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. LÄS MER
3. Everyday mining : Exploring sequences in event-based data
Sammanfattning : Event-based data are encountered daily in many disciplines and are used for various purposes. They are collections of ordered sequences of events where each event has a start time and a duration. LÄS MER
4. Constructing Evolutionary Trees - Algorithms and Complexity
Sammanfattning : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. LÄS MER
5. Proactive Software Complexity Assessment
Sammanfattning : Large software development companies primarily deliver value to their customers by continuously enhancing the functionality of their products. Continuously developing software for customers insures the enduring success of a company. LÄS MER