• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3998
  • 566
  • 498
  • 206
  • 200
  • 122
  • 105
  • 79
  • 61
  • 49
  • 34
  • 30
  • 25
  • 18
  • 15
  • Tagged with
  • 7073
  • 2710
  • 2586
  • 2448
  • 1818
  • 1512
  • 1325
  • 1096
  • 669
  • 609
  • 606
  • 600
  • 518
  • 505
  • 503
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
231

Performance limits of MIMO wireless communications /

Chan, Wing Chau. January 2006 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2006. / Includes bibliographical references (leaves [129]-133). Also available in electronic version.
232

Models and methodologies for realistic propagation simulation for urban mesh networks

Sridhara, Vinay. January 2007 (has links)
Thesis (Ph.D.)--University of Delaware, 2007. / Principal faculty advisor: Stephan K. Bohacek, Dept. of Electrical and Computer Engineering. Includes bibliographical references.
233

On multihop wireless network management measurement, modeling and control /

Wang, Feng, January 1900 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2007. / Vita. Includes bibliographical references.
234

Feasibility and performance analysis of sensor modeling in OPNET /

Krishnamurthi, Niranjan. January 2007 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2007. / Typescript. Includes bibliographical references (leaves 119-122).
235

Opportunistic multiple antenna systems with partial channel knowledge and limited feedback /

Ozdemir, Ozgur, January 2007 (has links)
Thesis (Ph. D.) -- University of Texas at Dallas, 2007. / Includes vita. Includes bibliographical references (leaves 78-80)
236

Studies on reliable and accurate services for event sensing, reporting, and monitoring applications /

Zhang, Yuecheng. January 2006 (has links)
Thesis (Ph. D.)--Lehigh University, 2006. / Includes vita. Includes bibliographical references (leaves 135-146).
237

Location-aware information access through wireless networks /

Kang, Jong Hee. January 2006 (has links)
Thesis (Ph. D.)--University of Washington, 2006. / Vita. Includes bibliographical references (p. 136-142).
238

Communications over noncoherent doubly selective channels

Pachai Kannu, Arun, January 2007 (has links)
Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 142-147).
239

Mobile video networking

Cherriman, Peter John January 1998 (has links)
No description available.
240

Upper and lower bounds for the fixed spectrum frequency assignment problem

Montemanni, Roberto January 2001 (has links)
The frequency assignment problem involves the assignment of discrete channels (frequencies) to the transmitters of a radio network. A separation between the frequencies assigned to transmitters close to each other is required to avoid interference. Unnecessary separation causes an excess requirement for spectrum, which is a valuable resource. Consequently good assignments minimise both interference and the spectrum required. The subject of this thesis is the fixed spectrum frequency assignment problem, where the spectrum available is given and the target is to minimize the total interference of the system. Interference is modelled through binary constraints, and consequently the problem, which is treated as a combinatorial optimisation problem, can be represented by an undirected weighted graph. A summary of some of the integer programming formulations which model the problem is presented, together with a brief dimensional study of them. An efficient implementation of two well-known metaheuristic algorithms, adapted to the problem treated, is described. Some novel lower bounding techniques which, given a problem, work by combining lower bounds calculated for some of its clique-like subproblems are presented. The key idea is that it is quite easy to calculate tight lower bounds for problems represented by complete graphs (cliques). The lower bounds for clique-like subproblems are produced by two different methods, the first of which is based on the solution of a linear program, while the second is based on a closed formula. The most effective method to generate estimates for general problems is based on a linear program which is reinforced with inequalities derived from the lower bounds calculated on its clique-like subproblems. The last part of the thesis is dedicated to improvements to the lower bounding techniques, both for those working on general problems and for those developed for cliques only. Detailed computational results, obtained on a wide range of benchmarks, are reported.

Page generated in 0.0777 seconds