Global ETD Search

81	Study of Channel Estimation in MIMO-OFDM for Software Defined Radio Wang, Qi January 2007 (has links) <p>The aim of the thesis is to find out the most suitable channel estimation algorithms for the existing MIMO-OFDM SDR platform. Starting with the analysis of several prevalent channel estimation algorithms, MSE performance are compared under different scenarios. As a result of the hardware independent analysis, the complexvalued matrix computations involved in the algorithms are decomposed to real FLoating-point OPerations (FLOPs). Four feasible algorithms are selected for hardware dependent discussion based on the proposed hardware architecture. The computational latency is exposed as a manner of case study.</p> SDR MIMO-OFDM Channel Estimation Computational Complexity Computer engineering Datorteknik
82	Role Based Hedonic Games Spradling, Matthew 01 January 2015 (has links) In the hedonic coalition formation game model Roles Based Hedonic Games (RBHG), agents view teams as compositions of available roles. An agent's utility for a partition is based upon which role she fulfills within the coalition and which additional roles are being fulfilled within the coalition. I consider optimization and stability problems for settings with variable power on the part of the central authority and on the part of the agents. I prove several of these problems to be NP-complete or coNP-complete. I introduce heuristic methods for approximating solutions for a variety of these hard problems. I validate heuristics on real-world data scraped from League of Legends games. coalition formation computational complexity hedonic games optimization Computational Engineering
83	A software size estimation tool: Hellerman's complexity measure Lermer, Toby, University of Lethbridge. Faculty of Arts and Science January 1995 (has links) No abstract available / 28 cm. Dissertations, Academic Computational complexity
84	Delay computation in switch-level models of MOS circuits Martin, Denis. January 1988 (has links) No description available. Metal oxide semiconductors Switching theory Computational complexity Delay lines
85	Topics in computational complexity Farr, Graham E. January 1986 (has links) The final Chapter concerns a problem of partitioning graphs subject to certain restrictions. We prove that several subproblems are NP-complete. 510
86	Fast algorithms for computing statistics under interval uncertainty with applications to computer science and to electrical and computer engineering / Xiang, Gang, January 2007 (has links) Thesis (Ph. D.)--University of Texas at El Paso, 2007. / Title from title screen. Vita. CD-ROM. Includes bibliographical references. Also available online.
87	Spatial problem solving for diagrammatic reasoning Banerjee, Bonny, January 2007 (has links) Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 78-80).
88	Solving the binary integer bi-level linear programming problem / Hocking, Peter M. January 2004 (has links) (PDF) Thesis (M.S.)--University of North Carolina at Wilmington, 2004. / Includes bibliographical references (leaf : 32).
89	Multiple modeling and control of nonlinear systems with self-organizing maps Cho, Jeongho. January 2004 (has links) Thesis (Ph. D.)--University of Florida, 2004. / Title from title page of source document. Document formatted into pages; contains 130 pages. Includes vita. Includes bibliographical references.
90	On some complexity problems in finite algebras Kozik, Marcin. January 2004 (has links) Thesis (Ph. D. in Mathematics)--Vanderbilt University, Dec. 2004. / Title from title screen. Includes bibliographical references.

Search results