201 |
A Self Building SystemYu, Tao 21 April 2009 (has links)
No description available.
|
202 |
Distribuovaná syntaktická analýza / Distributed ParsingLipowski, Jan Unknown Date (has links)
The thesis presents a method of the delimiter based syntax analysis. There is introduced a definition, an algoritm of the computation and analysis of the delimiters in the thesis. Farther the thesis presents an algorithm creating a distributed parser based on the input grammar with the analysed delimiter symbols. Then there is introduced an implementation of the distributed parser created by the introduced method.
|
203 |
Locating and Total Dominating Sets in TreesHaynes, Teresa W., Henning, Michael A., Howard, Jamie 01 May 2006 (has links)
A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to a vertex in S. We consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.
|
204 |
Catalog Tactics, A Tactics Cat Log, A Cat's Tact Logic / SET / Catalog Tactics, A Tactic's Cat Log, A Cat's Tact LogicNordin, Joanna January 2015 (has links)
[I examensarbetet ingår utställningen "SET / Catalog Tactics, A Tactic's Cat Log, A Cat's Tact Logic"]: Material/Teknik: Rum och text.
|
205 |
Finite set control transcription for optimal control applicationsStanton, Stuart Andrew 23 October 2009 (has links)
An enhanced method in optimization rooted in direct collocation is formulated to
treat the finite set optimal control problem. This is motivated by applications in which
a hybrid dynamical system is subject to ordinary differential continuity constraints, but
control variables are contained within finite spaces. Resulting solutions display control discontinuities
as variables switch between one feasible value to another. Solutions derived are
characterized as optimal switching schedules between feasible control values. The methodology
allows control switches to be determined over a continuous spectrum, overcoming
many of the limitations associated with discretized solutions. Implementation details are
presented and several applications demonstrate the method’s utility and capability. Simple
applications highlight the effectiveness of the methodology, while complicated dynamic
systems showcase its relevance. A key example considers the challenges associated with
libration point formations. Extensions are proposed for broader classes of hybrid systems. / text
|
206 |
Soft AI methods and visual speech recognitionSaeed, Mehreen January 1999 (has links)
No description available.
|
207 |
Mass assignments for inductive logic programmingHill, Carla January 2000 (has links)
No description available.
|
208 |
Essays on quasi-orderings and population ethicsPiggins, Ashley James January 1998 (has links)
No description available.
|
209 |
Machine learning techniques for signal processing, pattern recognition and knowledge extraction from examplesGooch, Richard M. January 1995 (has links)
No description available.
|
210 |
Person and Number Marking in LakotaFountain, Amy 02 August 2010 (has links)
A introductory problem set in morphology using Lakota (Siouan). Set includes a word and pdf version, but no answer key. Note that the word document uses the old SIL Doulos IPA93 font. / This collection consists of learning objects developed for use in courses offered by the Department of Linguistics. Learning objects include lectures, presentations, quizzes, activities, and more. Access to this collection is restricted to authorized faculty and instructors.
For access to this collection, please contact Dr. Amy Fountain, Department of Linguistics, avf@email.arizona.edu.
|
Page generated in 0.0455 seconds