• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4347
  • 1626
  • 598
  • 349
  • 331
  • 215
  • 77
  • 65
  • 64
  • 57
  • 57
  • 57
  • 57
  • 57
  • 56
  • Tagged with
  • 10626
  • 3573
  • 1740
  • 1377
  • 1317
  • 1265
  • 1211
  • 1101
  • 1070
  • 1040
  • 976
  • 931
  • 823
  • 778
  • 648
  • 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.
441

Some aspects of stability in nonlinear programming

Wolkewicz, Gail S. K., 1950- January 1978 (has links)
No description available.
442

Optimization of industrial processes using economic performance criteria.

Brais, André Roger. January 1967 (has links)
No description available.
443

A parallel processing system to solve the 0-1 programming problem /

Desai, Bipin C. January 1977 (has links)
No description available.
444

Automated translation of dynamic programming problems to Java code and their solution via an intermediate Petri net representation

Mauch, Holger January 2005 (has links)
Thesis (Ph. D.)--University of Hawaii at Manoa, 2005. / Includes bibliographical references (leaves 197-202). / Also available by subscription via World Wide Web / xi, 202 leaves, bound ill. 29 cm
445

Factor-product model for beef - a quadratic programming formulation

Yeh, Chia-lin Cheng January 1968 (has links)
Typescript. / Thesis (Ph. D.)--University of Hawaii, 1968. / Bibliography: leaves [116]-119. / vi, 119 l maps, tables
446

A study of student problems in learning to program

Moström, Jan Erik January 2011 (has links)
Programming is a core subject within Computer Science curricula and many also consider it a particularly difficult subject to learn. There have been many studies and suggestions on what causes these difficulties and what can be done to improve the situation. This thesis builds on previous work, trying to understand what difficulties students have when learning to program. The included papers cover several areas encountered when trying to learn programming. In Paper I we study how students use annotations during problem solving. The results show that students who annotate more also tend to be more successful. However, the results also indicate that there might be a cultural bias towards the use of annotations. Not only do students have problems with programming, they also have problems with designing software. Even graduating students fail to a large extent on simple design tasks. Our results in Paper II show that the majority of the students do not go beyond restating the problem when asked to design a system. Getting stuck is something that most learners experience at one time or another. In Paper III we investigate how successful students handle these situations. The results show that the students use a large number of different strategies to get unstuck and continue their learning. Many of the strategies involve social interaction with peers and others. In Papers IV, V, and VI we study what students experience as being key and threshold concepts in Computer Science. The results show that understanding particular concepts indeed affect the students greatly, changing the way they look at Computer Science, their peers, and themselves. The two last papers, Papers VII and VIII, investigate how researchers, teachers and students view concurrency. Most researchers/teachers claim that students have difficulties because of non-determinism, not understanding synchronization, etc. According to our results the students themselves do not seem to think that concurrency is significantly more difficult than any other subject. Actually most of them find concurrency to be both easy to understand and fun. / Programmering har en central roll i datavetenskapliga utbildningar. Många anser att programmering är svårt att lära sig. Ett stort antal studier har undersökt vad som orsakar dessa svårigheter och hur det är möjligt att övervinna dem. Denna avhandling är en del av denna forskning. Artiklarna i avhandlingen undersöker vilka problem som studenterna stöter på under sina programmeringsstudier. Artikel 1 beskriver hur studenter använder sig av annoteringar vid problemlösning. Resultaten visar att studenter som gör många annoteringar tenderar att prestera bättre. Resultaten antyder också att det kan finnas kulturella skillnader i hur ofta annoteringar används. Studenter har inte bara problem vid programmering, de har också problem med att utforma programvarusystem. Även sistaårsstudenter misslyckas till stor del att utforma lösningar för relativt enkla system. Resultaten i Artikel II visar att majoriteten av studenterna inte kommer längre än en omformulering av problemet. Att inte förstå ett koncept eller en specifik detalj är något som alla studenter stöter på då och då. I Artikel III undersöker vi hur framgångsrika studenter hanterar en sådan situation. Resultaten visar att studenterna använder sig av ett stort antal olika strategier för att få en förståelse för konceptet/detaljen. Många av de redovisade strategierna bygger på en social interaktion med andra. Artiklarna IV, V och VI utforskar vad studenterna uppfattar som nyckelkoncept inom datavetenskap och hur förståelsen av dessa koncept påverkar dem. Resultaten visar att förståelsen av vissa specifika koncept kan göra att studenterna ändrar hur de ser på datavetenskap, kollegor och sig själva. I artiklarna VII och VIII undersöker vi hur forskare, lärare och studenter ser på de problem studenter har vid jämlöpande programmering. De flesta forskare och lärare hävdar att studenterna har problem med att förstå icke-determinism, synkronisering, etc. Våra resultat visar dock att studenterna inte själva tycks anse att jämlöpande programmering är signifikant svårare än andra ämnen. Tvärtom, de flesta anser att jämlöpande programmering är både lätt att förstå och roligt.
447

Integer programming methods for solving multi-skilled workforce optimisation problems /

Eitzen, Guy E. Unknown Date (has links)
Generating employee rosters on a 24 hour, 7 day per week basis taking into account fluctuating demand for employees, employee skills, working conditions, training and employee preferences, while ensuring efficiency and equity between the employees is a very difficult task due to the very large number of possible rostering combinations available. The research done in this thesis sets to solve this exact problem for CS Energy's Swanbank Power Station located in Queensland, Australia. -- abstract. / Thesis (PhDMathematics)--University of South Australia, 2002.
448

Usability evaluation of grammar formalisms for free wold order natural language processing

Pedersen, M. Unknown Date (has links)
No description available.
449

Jasmine: A shared-object multi-locking distributed shared memory system for heterogeneous computers

Wong, K. Unknown Date (has links)
No description available.
450

An application of linear programming to the scheduling of toll collectors

Byrne, John Leonard January 1970 (has links)
iv, 115 leaves : ill. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.1972) from the Dept. of Mathematics, University of Adelaide

Page generated in 0.0827 seconds