Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"PARALLEL COMPLEXITY"”.
-
ΧΕΙΡΟΤΕΡΗ ΚΑΙ ΜΕΣΗ ΣΥΜΠΕΡΙΦΟΡΑ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΓΙΑ ΠΡΟΒΛΗΜΑΤΑ ΓΡΑΦΩΝ
IN THIS THESIS FAST, OPTIMAL AND/OR EFFICIENT PARALLEL ALGORITHMS ARE DEVELOPEDFOR MANY IMPORTANT GRAPH PROBLEMS WHICH IMPROVE SIGNIFICANTLY THE COMPLEXITIESOF THE BEST PREVIOUS KNOWN PARALLEL ALGORITHMS ON THE SAME PROBLEMS. MORE PRECISELY WE INVESTIGATE, (I) THE WORST-CASE PARALLEL COMPLEXITY …
-
Parallel Programming Languages for Collections
… design, expressive power, and implementation of parallel programming languages for collections, the fragment dealing with collections of an object-oriented query language. The Relational Algebra has a simple, intrinsic parallel semantics, which enabled the successful development of parallel …
-
Development of a framework for parallel reservoir simulation
Parallel reservoir simulation is a topic of special interest to reservoir engineers and reservoir simulator developers. Parallel reservoir simulators provides several advantages over non-parallel reservoir simulators, such as • Capability to run bigger models. • Capability to have simulation …
-
ΔΙΑΤΑΞΕΙΣ ΔΙΑΓΡΑΦΩΝ, ΠΑΙΧΝΙΔΙΑ ΚΑΙ ΕΛΑΣΣΟΝΑ ΣΕ ΓΡΑΦΗΜΑΤΑ
… ARE THE INVESTIGATION OF THEIR COMPUTATIONAL COMPLEXITY, THE FINDING OF UPPER AND LOWER BOUNDS TO THEIR VALUES, THEIR RELATION WITH GRAPH SEARCHING PROBLEMS AND THEIR APPLICATION ON THE CONSTRAINT SATISFACTION PROBLEM AND THE ROUTING PROBLEM ON DISTRIBUTED COMPUTING SYSTEMS. THE BASIC RESULTS …