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 30575 for “"Problems"”.
-
Extremal Problems in Combinatorics: Covering and Coloring Problems
The Ramsey-type coloring problems we consider include generalized Ramsey and generalized Anti-Ramsey problems. Namely, what is the minimal (or maximal) number of colors on the edges of a graph such that every subgraph isomorphic to some fixed graph uses at most q2 and at least q1 colors on its …
-
A Study of Relationship Between Reading Problems and Emotional Problems.
Since emotional and personality problems may affect learning, it appears that some emotional problems which children possess may be directly related to their ability to read. This study is concerned with an analysis of actual case studies of children who were referred to a remedial reading …
-
Generalized Satisfiability Problems
… of complexity theory is the classification of problems with respect to their consumption of resources (e.g., running time or required memory). To study the computational complexity (i.e., consumption of resources) of problems, similar problems are grouped into so called complexity classes. …
-
Hidden Number Problems
The hidden number problem is the problem of recovering an unknown group element (the "hidden number") given evaluations of some function on products of the hidden number with known elements in the group. This problem enjoys a vast variety of applications, and provides cross-fertilisation among …
-
Nonlinear eigenvalue problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1998.
-
Online optimization problems
In this thesis, we study online optimization problems in routing and allocation applications. Online problems are problems where information is revealed incrementally, and decisions must be made before all information is available. We design and analyze algorithms for a variety of online problems, …
-
Problems in zen
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Humanities, 1969.
-
Combinatorial incremental problems
… class of Incremental Combinatorial optimization problems, where solutions are evaluated as they are built, as opposed to only measuring the performance of the final solution. Even though many of these problems have been studied, it has' usually been in isolation, so the first objective of this …
-
Problems of compositionality
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1995.
-
Multivariable Interpolation Problems
… multivariable Nevanlinna-Pick type interpolation problems. Particularly, we consider the left tangential interpolation problems on the commutative or noncommutative unit ball. For the commutative setting, we discuss left-tangential operator-argument interpolation problems for Schur-class …
-
Contributions on secretary problems, independent sets of rectangles and related problems
We study three problems arising from different areas of combinatorial optimization. We first study the matroid secretary problem, which is a generalization proposed by Babaioff, Immorlica and Kleinberg of the classical secretary problem. In this problem, the elements of a given matroid are revealed …
-
Techniques in interpolation problems
… studies degeneration techniques in interpolation problems, that can be phrased as computing the dimension of the space of plane curves of degree d having general multiple points. The general interpolation problem goes back to the origin of algebraic geometry and is still far from being solved. We …
-
Problems in GPS Accuracy
… to many interesting and challenging mathematical problems. This dissertation investigates two such problems. The first problem involves the study of the relationship between positioning accuracy and satellite geometry configurations relative to a user's position. In this work, accuracy is measured …
-
Extremal Problems for Hypergraphs
We study various extremal problems on hypergraphs
-
Matching problems in hypergraphs
Kühn, Osthus, and Treglown and, independently, Khan proved that if H is a 3-uniform hypergraph on n vertices, where n is a multiple of 3 and large, and the minimum vertex degree of H is greater than {(n-1) choose 2} - {2n/3 choose 2}, then H contains a perfect matching. We show that for …
Page 1 of 1529