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 20 of 1171 for “"fixed point"”.
-
Applications in Fixed Point Theory
… probably one of the most important theorems in fixed point theory. It has been used to develop much of the rest of fixed point theory. Another key result in the field is a theorem due to Browder, Göhde, and Kirk involving Hilbert spaces and nonexpansive mappings. Several applications of Banach's …
-
Fixed-point implementace rozpoznávače řeči
… na embedded systémy, ktoré nedisponujú floating-point výpočetnými jednotkami. V prvom rade bola zvolená vhodná hardwarová architektúra a s ohľadom na dostupné prostriedky, ktorými vybraná architektúra disponuje, bolo navrhnuté riešenie rozpoznávania reči. Jednotlivé časti systému rozpoznávania …
-
On the almost fixed point property
Electronic Thesis or Dissertation
-
Canonical Laminations for Fixed Point Portraits
… Every complex polynomial of degree d has d fixed points counted with multiplicity. From the point of view of laminations, exactly d−1 of these fixed points are peripheral (approachable from outside the Julia set of the polynomial). Hence, at least one of the d fixed points is “hidden” from …
-
Fixed Point Theorems for Nonexpansive Mappings
Made available in DSpace on 2014-12-09T22:17:56Z (GMT). No. of bitstreams: 1 7013546.pdf: 2174071 bytes, checksum: f1cafc313cc47fbfa02e94c0aa6756f1 (MD5) Previous issue date: 1969
-
A new fixed point for Mottness
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-20 without embargo terms
-
Fixed-Point-Free Involution Word Diagrams
We define a useful diagram for studying fixed-point-free involution words. Following the example of Little, we define a specific and a general bumping algorithm on these diagrams. These algorithms serve as the basis for bijective proofs of corresponding transition equations for fixed-point-free …
-
Selected theorems on the fixed point property
Not available
-
LEAST FIXED POINT COMPUTING IN RELATIONAL DATABASE
… explores approaches and implementation of least fixed point(LFP) operator in relational database context. The special case of transitive closure(TC) computing is studied intensively. TC algorithms can be classified into two types: set-oriented and tuple-oriented algorithms. Performance of TC …
Page 1 of 59