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 6 of 6 for “"linear list"”.
-
Cache Oblivious Data Structures
… the array used for binary search and the linear list. As well as being cache oblivious, the structures presented in this thesis are space efficient, requiring little additional storage. We begin the discussion with a layout for a search tree within an array. This layout allows Searches to …
-
The design and evaluation of Novel prototypes to visualize web browsing history
… the manner in which the pages are displayed: a linear list of textual links. This thesis investigates the redesign of the history tool by introducing visualization to display the visited Web pages. Three distinct visual prototypes were designed ranging from a traditional scientific visualization …
-
Cognitive load of critical thinking strategies
… compared to using a less diagrammatic structure (linear list)? It is hypothesized that the weighing strategy would impose greater cognitive load, as measured by mental effort rating scale and time, than constructing a design claim strategy. As proposed by Nussbaum (2008), in using weighing …
-
Representing Information Collections for Visual Cognition
… are typically represented with text-only, in a linear list format, which turns out to be a weak representation for cognition. We learned this from empirical research in cognitive psychology, and by conducting a study to develop an understanding of current practices and resulting breakdowns in …
-
A Study on Graph Coloring and Digraph Connectivity
… which a graph G has a (k,r)-coloring.;For a k-list assignment L to vertices of a graph G, a linear (L,r)-coloring of a graph G is a coloring c of the vertices of G such that for every vertex v of degree d(v), c(v)∈ L(v), the number of colors used by the neighbors of v is at least …
-
Příprava domácích úloh pro předmět Algoritmy
Práce se zaměřuje zejména na implementaci domácích úloh pro předmět Algoritmy, jež je vyučován v druhém ročníku na Fakultě informačních technologií Vysokého učení technického v Brně. Pro vyhodnocování zmíněných domácích úloh je využit systém pro automatizované vyhodnocování domácích úloh. Součástí …