• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4301
  • 1625
  • 598
  • 349
  • 331
  • 211
  • 77
  • 65
  • 64
  • 57
  • 57
  • 57
  • 57
  • 57
  • 56
  • Tagged with
  • 10550
  • 3550
  • 1730
  • 1367
  • 1300
  • 1265
  • 1205
  • 1073
  • 1070
  • 1018
  • 965
  • 929
  • 815
  • 770
  • 641
  • 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.

Multitasking in a user partition with a contour model of processes

Allen, Lee January 2010 (has links)
Digitized by Kansas Correctional Industries

Method of lagrange multipliers and the Kuhn-Tucker conditions

Gupta, Pramod Kumar January 2010 (has links)
Digitized by Kansas Correctional Industries

Geometric programming : methods for dealing with degrees of difficulty

Parchami-Ghaferokhi, Parviz January 2010 (has links)
Digitized by Kansas Correctional Industries

Limitations of and extensions to heuristic search planning

Burfoot, Daniel. January 2006 (has links)
No description available.

Computational improvements to Benders decomposition for generalized fixed charge problems /

Battilega, John Anthony. January 1973 (has links)
Thesis (Ph. D.)--Oregon State University, 1973. / Typescript (photocopy). Includes bibliographical references. Also available on the World Wide Web.

An integer programming model for Navy's Maritime Patrol Aviation fleet

Drash, Robert W. January 1990 (has links) (PDF)
Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 1990. / Thesis Advisor(s): Wood, R. Kevin. Second Reader: Rosenthal, Richard E. "September 1990." Description based on title screen as viewed on December 17, 2009. Author(s) subject terms: Optimization, P-3, modernization, integer programming. Includes bibliographical references (p. 69). Also available in print.

Dynamic channel allocation /

Kaminsky, Andrew D. January 2003 (has links) (PDF)
Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2003. / Thesis advisor(s): John Gibson, Geoffrey Xie. Includes bibliographical references (p. 191-193). Also available online.

Efficient presolving in linear programming

Sadhana, Vishnu V. January 2002 (has links)
Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Document formatted into pages; contains ix, 71 p. Includes vita. Includes bibliographical references.

Musical expertise as a scaffold for novice programming

Benton, Thomas Jonathan 04 September 2015 (has links)
This study addresses the role of musical expertise on novice computer programming. Engaging novices with computer programming is one of the great challenges of computer science education. Although there is extensive research focusing on constructionist approaches to programming education and creative entry points to programming, little research addresses the topic of how musical expertise informs an unstructured programming activity. To answer this question I focused on the role of participant talk during programming, patterns in participant programming, and evidence of computational thinking in participants’ final Scratch projects. For this interpretivist study, I worked with a dozen novice programmers from a variety of musical backgrounds: classical musicians, jazz musicians, composers, and non- musicians. Each participant worked on a free-form musical project in the Scratch programming environment. I collected data including participant talk, screen recordings of participant programming, and participants’ final Scratch projects. Overall, musical participants more readily took to the numeracy involved in programming music in Scratch. Also, musical participants were able to use musical concepts and techniques as jumping-off points for programming challenges. Considering my results by participant group, composers stood out in a number of ways: working the longest, testing their programs the most often, adding Scratch objects the slowest, v removing the most Scratch objects, creating projects of the greatest nested depth, and unanimous use of operators and random numbers. Non-musicians, on the other hand, worked for the shortest amount of time, added the fewest Scratch objects, and created projects of the lowest nested depth. In addition to adding to the body of research around chunking and tinkering, this study reinforces the importance of context and comfort in an introduction to computer programming. Composition may be an especially rich area to leverage, given the design- like programming activity of the composers here. Future research projects could resemble this one while focusing on younger learners, explicit musical concepts like those invoked by participants, or alternative performing arts framings such as theater or dance. / text

Computer explorations.

Howson, Hugh R. January 1971 (has links)
No description available.

Page generated in 0.1159 seconds