subject:(Heuristics)

University of Toronto

1. Lee, Kiyeon. An Investigation of the Use of Heuristics on Judgment.

Degree: 2012, University of Toronto

►

How and when are individuals more or less influenced by heuristics when making judgments? The first essay of my dissertation examines whether individuals can reduce… (more)

▼

How and when are individuals more or less influenced by heuristics when making judgments? The first essay of my dissertation examines whether individuals can reduce their reliance on heuristics that cause them to form biased judgments. According to Kahneman and Frederick (2002, 2005), people have a tendency to commit judgmental biases by basing their judgments on accessible heuristic cues (heuristic attributes) rather than relevant cues (target attributes). This prevalent tendency to substitute an inaccessible (but relevant) attribute with an accessible (but irrelevant) attribute results in a biased judgment. To eliminate people’s tendency to rely on heuristics, the first essay of my dissertation examines whether it is possible to make the target attribute more readily accessible in individuals’ minds by merely exposing individuals to the relevant cue – the target attribute using a non-conscious prime. I demonstrate that brief exposure (20 milliseconds) of the target attribute can increase the accessibility of the target attribute and reduce judgmental biases. The second essay of my dissertation examines the ease-of-retrieval heuristic. Previous research has shown that the ease of retrieving information leads to more favorable judgments, whereas the difficulty of retrieving information leads to less favorable judgments (Menon & Raghubir, 2003; Schwarz et al., 1991; Tormala, Petty, & Briñol, 2002; Tversky & Kahneman, 1973). Contrary to previous research, I find that, when individuals have the opportunity to use a product (i.e., direct product experience), the influence of ease-of-retrieval on their judgments becomes reversed. In particular, after a gustatory product experience with a soft drink or a tactile product experience with a hand lotion, individuals evaluate the product more (less) favorably when listing many reasons why they like (dislike) the product compared to listing a few reasons. I demonstrate that this finding is not a result of alternative explanations such as motivation levels or the reliance of the content of reasons.

PhD

Advisors/Committee Members: Mitchell, Andrew, Management.

Subjects/Keywords: biases; heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lee, K. (2012). An Investigation of the Use of Heuristics on Judgment. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/67285

Chicago Manual of Style (16^th Edition):

Lee, Kiyeon. “An Investigation of the Use of Heuristics on Judgment.” 2012. Doctoral Dissertation, University of Toronto. Accessed February 26, 2021. http://hdl.handle.net/1807/67285.

MLA Handbook (7^th Edition):

Lee, Kiyeon. “An Investigation of the Use of Heuristics on Judgment.” 2012. Web. 26 Feb 2021.

Vancouver:

Lee K. An Investigation of the Use of Heuristics on Judgment. [Internet] [Doctoral dissertation]. University of Toronto; 2012. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1807/67285.

Council of Science Editors:

Lee K. An Investigation of the Use of Heuristics on Judgment. [Doctoral Dissertation]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/67285

University of Edinburgh

2. Campbell, Madeleine. Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?.

Degree: 2007, University of Edinburgh

URL: http://hdl.handle.net/1842/1926

► A fundamental question in developmental linguistics and developmental psychology is how young children learn new words. While some researchers suggest that words are primarily learned… (more)

▼ A fundamental question in developmental linguistics and developmental psychology is how young children learn new words. While some researchers suggest that words are primarily learned through experience, others argue that the acquisition process is guided by innate lexical biases. One of the most widely studied biases is the Mutual Exclusivity Bias (ME), which describes children’s preference for just one label per concept. The disambiguation effect in ME has been demonstrated extensively with ostensive paradigms requiring young monolingual children to choose between familiar and novel labels in identifying unfamiliar objects. However, evidence for ME within languages in bilingual children is mixed. In the present study, a productive naming paradigm was used to assess 3-year-olds’ tendency to adopt novel labels for familiar items (a variant on Merriman and Bowman’s (1989) rejection/correction effect). Five monolingual and 5 bilingual children aged 2;11-3;6 were tested in English. Following a training session when the experimenter applied novel labels to 3 of 12 pictures of familiar objects, the children played two successive naming games. The first game involved further reinforcement of the novel labels by the experimenter while the second game did not. In the first game, the bilingual children adopted novel labels more frequently (Mdn=.40) than the monolingual children (Mdn=.13) and Mann-Whitney’s (one-tailed exact) U=3.0, was significant, p<0.05 with a large effect size (r=-.63). In contrast, only one bilingual produced a novel label in the second game. Measures of receptiveness in the training session displayed asymmetries between production and comprehension. Overall the results suggest that experience of two languages plays an important role in learning novel labels. The findings are consistent with an account of ME as a heuristic learned from monolingual input, the application of which varies in bilingual preschoolers according to both ambient language and socio-pragmatic context. The results are discussed in the context of what insights can be gained from possible extensions to the experiment. Advisors/Committee Members: Tamariz, Monica, Skarabela, Barbora.

Subjects/Keywords: linguistics; bilingual; heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Campbell, M. (2007). Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/1926

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Campbell, Madeleine. “Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?.” 2007. Thesis, University of Edinburgh. Accessed February 26, 2021. http://hdl.handle.net/1842/1926.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Campbell, Madeleine. “Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?.” 2007. Web. 26 Feb 2021.

Vancouver:

Campbell M. Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?. [Internet] [Thesis]. University of Edinburgh; 2007. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1842/1926.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Campbell M. Word learning in preschoolers: are bilingual 3-year-olds less guided by mutual exclusivity than their monolingual counterparts?. [Thesis]. University of Edinburgh; 2007. Available from: http://hdl.handle.net/1842/1926

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Notre Dame

3. Claudia Anewalt-Remsburg. Candidate Cues: Race, Ethnicity, and Partisanship</h1>.

Degree: Political Science, 2013, University of Notre Dame

URL: https://curate.nd.edu/show/p8418k7407w

► Previous scholarship on the effect of candidate race on voter evaluations and behavior finds that black candidates are disadvantaged. With the election of the… (more)

▼ Previous scholarship on the effect of candidate race on voter evaluations and behavior finds that black candidates are disadvantaged. With the election of the first African-American president, do voters still view black candidates as less qualified and more liberal? Prior research may not be current for the 21st century, and despite a broad literature that focuses on the role of race in American Politics, growing interest in Latino politics tends to focus on Latino voters rather than evaluations of Latino candidates. Both literatures also overlook how voters use both race and ethnicity cues along with candidate partisanship. This dissertation explores the effect of candidate race and ethnicity on voter evaluations and behavior. Cue Consistency Theory develops hypotheses about how voters will react to these cues in isolation as well as how they interact with candidate partisanship. Original survey experiments were conducted to inquire how candidate race affect voter evaluations of the candidate’s ideology, issue position, competence and qualifications, as well as voter behavior. Overall, the results of the non-partisan context show that Democratic respondents inferred Democratic partisanship from black and Latino candidates, and were particularly favorable in their evaluations and support of these candidates. In a partisan context, race and ethnicity does not have an additive effect, that is black and Latino Democrats are not perceived as more liberal than an identical white Democrat. Likewise, on most measures of ideology and issue position, black and Latino Republicans were not perceived as less conservative than an identical white Republican. In general, race and ethnicity does not negatively affect perceptions of competence and qualifications, nor does it affect turnout and candidate support. On some measures of respondents’ attitudes, Republican respondents were less favorable towards black and Latino candidates. Specifically, in a non-partisan context, Republicans found the black candidate less qualified, and those with cold to neutral feelings towards blacks were less likely to support that candidate. In the partisan context, the Latino conservative Republican was particularly disadvantaged; being perceived as more liberal on taxing and spending, as well as less capable of balancing the budget and working with leaders in business and industry. Advisors/Committee Members: David Nickerson, Committee Member, John D. Griffin, Committee Chair, Geoffrey Layman, Committee Member.

Subjects/Keywords: heuristics; candidate characteristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Anewalt-Remsburg, C. (2013). Candidate Cues: Race, Ethnicity, and Partisanship</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/p8418k7407w

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Anewalt-Remsburg, Claudia. “Candidate Cues: Race, Ethnicity, and Partisanship</h1>.” 2013. Thesis, University of Notre Dame. Accessed February 26, 2021. https://curate.nd.edu/show/p8418k7407w.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Anewalt-Remsburg, Claudia. “Candidate Cues: Race, Ethnicity, and Partisanship</h1>.” 2013. Web. 26 Feb 2021.

Vancouver:

Anewalt-Remsburg C. Candidate Cues: Race, Ethnicity, and Partisanship</h1>. [Internet] [Thesis]. University of Notre Dame; 2013. [cited 2021 Feb 26]. Available from: https://curate.nd.edu/show/p8418k7407w.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Anewalt-Remsburg C. Candidate Cues: Race, Ethnicity, and Partisanship</h1>. [Thesis]. University of Notre Dame; 2013. Available from: https://curate.nd.edu/show/p8418k7407w

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Alberta

4. Yang, Fan. Additive abstraction-based heuristics.

Degree: PhD, Department of Computing Science, 2011, University of Alberta

URL: https://era.library.ualberta.ca/files/fx719m90m

► In this thesis, we study theoretically and empirically the additive abstraction-based heuristics. First we present formal general definitions for abstractions that extend to general additive… (more)

Subjects/Keywords: heuristic search; additive; heuristics; abstraction

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yang, F. (2011). Additive abstraction-based heuristics. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/fx719m90m

Chicago Manual of Style (16^th Edition):

Yang, Fan. “Additive abstraction-based heuristics.” 2011. Doctoral Dissertation, University of Alberta. Accessed February 26, 2021. https://era.library.ualberta.ca/files/fx719m90m.

MLA Handbook (7^th Edition):

Yang, Fan. “Additive abstraction-based heuristics.” 2011. Web. 26 Feb 2021.

Vancouver:

Yang F. Additive abstraction-based heuristics. [Internet] [Doctoral dissertation]. University of Alberta; 2011. [cited 2021 Feb 26]. Available from: https://era.library.ualberta.ca/files/fx719m90m.

Council of Science Editors:

Yang F. Additive abstraction-based heuristics. [Doctoral Dissertation]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/fx719m90m

Cornell University

5. Steinhardt, Joseph. Heuristics And Biases In Narrative And Non-Narrative Risk Messages.

Degree: PhD, Communication, 2015, Cornell University

URL: http://hdl.handle.net/1813/40953

► Understanding the cognitive heuristics people use to make decisions and the biases in judgment resulting from their use has been a focus of risk communication… (more)

▼ Understanding the cognitive heuristics people use to make decisions and the biases in judgment resulting from their use has been a focus of risk communication research for nearly forty years. During that period, research has demonstrated consistent effects of these heuristics and biases across multiple contexts using fairly standardized approaches to measurement. My previous research, however, has found that people may make decisions inconsistent with the expectations of known cognitive biases when those decisions are situated within narratives. This dissertation expands on that work and examines the role narratives play in decision making, specifically in the reduction of cognitive biases caused by the use of mental heuristics when reading stories. Three experiments empirically examine three known biases: prospect theory framing effects, the effect to which people make different decisions depending on whether a choice is presented as a loss or as a gain (Chapter 2); anchoring effects, the effect to which people judge a decision based on an initial unrelated piece of information given prior to the decision (Chapter 3); and the gambler's fallacy, the faulty notion that the result of an independent event is related to the result of previous independent events (Chapter 4). Chapter two tests whether the influence of narratives over cognitive biases may result from goals held by readers. It found further evidence that narratives reduce the biases related to gain-loss framing effects and no evidence that this reduction was due to goals held while reading. Chapter three explores the role of perceived realism in bias reduction and also tests the anchoring and adjustment heuristic in a narrative. It found that narratives reduce biases related to the anchoring and adjustment heuristic and no evidence that perceived realism of the narratives influenced the reduction. Chapter four examines whether the presentation of a story as either first person or third person influences a reader's decision and also tests the gambler's fallacy in a narrative. The experiment yielded inconclusive results, specifically a difference between the narrative and non-narrative conditions that did not meet the standard and acceptable level of statistical significance. This is notably different from the results presented in chapters 2 and 3, and is possibly due to the fact that unlike the non-narrative versions of the framing and anchoring experiments, narrative information is inherently contained in the non-narrative condition of the gamblers fallacy as it pertains to an ordered sequence of events. Overall, the findings expand our understanding of narrative stories in risk communication as they relate to cognitive heuristics and biases. Specifically, the three experiments suggest that narratives reduce the biases caused by cognitive heuristics in risk decision-making. Advisors/Committee Members: McComas,Katherine Anne (chair), Byrne,Sahara E. (committee member), Niederdeppe,Jeffrey D. H. (committee member), Shapiro,Michael A (committee member), Strogatz,Steven H (committee member).

Subjects/Keywords: Risk Communication; Narratives; Heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Steinhardt, J. (2015). Heuristics And Biases In Narrative And Non-Narrative Risk Messages. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/40953

Chicago Manual of Style (16^th Edition):

Steinhardt, Joseph. “Heuristics And Biases In Narrative And Non-Narrative Risk Messages.” 2015. Doctoral Dissertation, Cornell University. Accessed February 26, 2021. http://hdl.handle.net/1813/40953.

MLA Handbook (7^th Edition):

Steinhardt, Joseph. “Heuristics And Biases In Narrative And Non-Narrative Risk Messages.” 2015. Web. 26 Feb 2021.

Vancouver:

Steinhardt J. Heuristics And Biases In Narrative And Non-Narrative Risk Messages. [Internet] [Doctoral dissertation]. Cornell University; 2015. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1813/40953.

Council of Science Editors:

Steinhardt J. Heuristics And Biases In Narrative And Non-Narrative Risk Messages. [Doctoral Dissertation]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/40953

Anna University

6. Raja K. Managing manufacturing projects using simulation and meta heuristics;.

Degree: Managing manufacturing projects using simulation and meta heuristics, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/27308

►

Companies today find themselves in a highly competitive newlineenvironment of rapidly changing operational requirements The need is to newlinemanage increasing product complexities shorter time to… (more)

Subjects/Keywords: mechanical engineering; meta heuristics; simulation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

K, R. (2014). Managing manufacturing projects using simulation and meta heuristics;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27308

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

K, Raja. “Managing manufacturing projects using simulation and meta heuristics;.” 2014. Thesis, Anna University. Accessed February 26, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/27308.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

K, Raja. “Managing manufacturing projects using simulation and meta heuristics;.” 2014. Web. 26 Feb 2021.

Vancouver:

K R. Managing manufacturing projects using simulation and meta heuristics;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Feb 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27308.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

K R. Managing manufacturing projects using simulation and meta heuristics;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27308

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

7. Girish B S. Population based search heuristics for scheduling job shops associated with multiple routings;.

Degree: search heuristics for scheduling job shops associated with multiple routings, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/26318

►

This thesis addresses two different models of job shop scheduling newlineapplications that are associated with multiple routings The first application is newlinethe well known scheduling… (more)

Subjects/Keywords: mechanical engineering; Population; search heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

S, G. B. (2014). Population based search heuristics for scheduling job shops associated with multiple routings;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26318

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

S, Girish B. “Population based search heuristics for scheduling job shops associated with multiple routings;.” 2014. Thesis, Anna University. Accessed February 26, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/26318.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

S, Girish B. “Population based search heuristics for scheduling job shops associated with multiple routings;.” 2014. Web. 26 Feb 2021.

Vancouver:

S GB. Population based search heuristics for scheduling job shops associated with multiple routings;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Feb 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26318.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

S GB. Population based search heuristics for scheduling job shops associated with multiple routings;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26318

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Anna University

8. Rajeswari N. Heuristics for parallel flow scheduling with due date based objective;.

Degree: Heuristics for parallel flow scheduling with due date based objective, 2015, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/34349

►

Scheduling theory is concerned with the allocation of a set of limited newlineresources to process a given number of jobs In fact a scheduling problem… (more)

Subjects/Keywords: Heuristics; mechanical engineering; parallel flow

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

N, R. (2015). Heuristics for parallel flow scheduling with due date based objective;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/34349

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

N, Rajeswari. “Heuristics for parallel flow scheduling with due date based objective;.” 2015. Thesis, Anna University. Accessed February 26, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/34349.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

N, Rajeswari. “Heuristics for parallel flow scheduling with due date based objective;.” 2015. Web. 26 Feb 2021.

Vancouver:

N R. Heuristics for parallel flow scheduling with due date based objective;. [Internet] [Thesis]. Anna University; 2015. [cited 2021 Feb 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34349.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

N R. Heuristics for parallel flow scheduling with due date based objective;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34349

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

9. Qin, Jianglei. Algorithms for an Unmanned Vehicle Path Planning Problem.

Degree: MS, Mechanical Engineering, 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/151090

► Unmanned Vehicles (UVs) have been significantly utilized in military and civil applications over the last decade. Path-planning of UVs plays an important role in effectively… (more)

Subjects/Keywords: Optimization; Heuristics; Prize-multiplier approach

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Qin, J. (2013). Algorithms for an Unmanned Vehicle Path Planning Problem. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151090

Chicago Manual of Style (16^th Edition):

Qin, Jianglei. “Algorithms for an Unmanned Vehicle Path Planning Problem.” 2013. Masters Thesis, Texas A&M University. Accessed February 26, 2021. http://hdl.handle.net/1969.1/151090.

MLA Handbook (7^th Edition):

Qin, Jianglei. “Algorithms for an Unmanned Vehicle Path Planning Problem.” 2013. Web. 26 Feb 2021.

Vancouver:

Qin J. Algorithms for an Unmanned Vehicle Path Planning Problem. [Internet] [Masters thesis]. Texas A&M University; 2013. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/1969.1/151090.

Council of Science Editors:

Qin J. Algorithms for an Unmanned Vehicle Path Planning Problem. [Masters Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151090

North Carolina State University

10. Gupta, Saurabh. Crossing Minimization in k-layer graphs.

Degree: MS, Computer Science, 2009, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/608

► The crossing minimization problem in graphs has been extensively studied for the case when graphs are to be embedded on two layers. There are many… (more)

Subjects/Keywords: Crossings; Minimization; Heuristics; Barycenter; Median

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gupta, S. (2009). Crossing Minimization in k-layer graphs. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/608

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gupta, Saurabh. “Crossing Minimization in k-layer graphs.” 2009. Thesis, North Carolina State University. Accessed February 26, 2021. http://www.lib.ncsu.edu/resolver/1840.16/608.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Gupta, Saurabh. “Crossing Minimization in k-layer graphs.” 2009. Web. 26 Feb 2021.

Vancouver:

Gupta S. Crossing Minimization in k-layer graphs. [Internet] [Thesis]. North Carolina State University; 2009. [cited 2021 Feb 26]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/608.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gupta S. Crossing Minimization in k-layer graphs. [Thesis]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/608

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Victoria University of Wellington

11. Hunt, Rachel. Genetic Programming Hyper-heuristics for Job Shop Scheduling.

Degree: 2016, Victoria University of Wellington

URL: http://hdl.handle.net/10063/5219

► Scheduling problems arise whenever there is a choice of order in which a number of tasks should be performed; they arise commonly, daily and everywhere.… (more)

▼ Scheduling problems arise whenever there is a choice of order in which a number of tasks should be performed; they arise commonly, daily and everywhere. A job shop is a common manufacturing environment in which a schedule for processing a set of jobs through a set of machines needs to be constructed. Job shop scheduling (JSS) has been called a fascinating challenge as it is computationally hard and prevalent in the real-world. Developing more effective ways of scheduling jobs could increase profitability through increasing throughput and decreasing costs. Dispatching rules (DRs) are one of the most popular scheduling heuristics. DRs are easy to implement, have low computational cost, and cope well with the dynamic nature of real-world manufacturing environments. However, the manual development of DRs is time consuming and requires expert knowledge of the scheduling environment. Genetic programming (GP) is an evolutionary computation method which is ideal for automatically discovering DRs. This is a hyper-heuristic approach, as GP is searching the search space of heuristic (DR) solutions rather than constructing a schedule directly. The overall goal of this thesis is to develop GP based hyper-heuristics for the efficient evolution (automatic generation) of robust, reusable and effective scheduling heuristics for JSS environments, with greater interpretability. Firstly, this thesis investigates using GP to evolve optimal DRs for the static two-machine JSS problem with makespan objective function. The results show that some evolved DRs were equivalent to an optimal scheduling algorithm. This validates both the GP based hyper-heuristic approach for generating DRs for JSS and the representation used. Secondly, this thesis investigates developing ``less-myopic'' DRs through the use of wider-looking terminals and local search to provide additional fitness information. The results show that incorporating features of the state of the wider shop improves the mean performance of the best evolved DRs, and that the inclusion of local search in evaluation evolves DRs which make better decisions over the local time horizon, and attain lower total weighted tardiness. Thirdly, this thesis proposes using strongly typed GP (STGP) to address the challenging issue of interpretability of DRs evolved by GP. Several grammars are investigated and the results show that the DRs evolved in the semantically constrained search space of STGP do not have (on average) performance that is as good as unconstrained. However, the interpretability of evolved rules is substantially improved. Fourthly, this thesis investigates using multiobjective GP to encourage evolution of DRs which are more readily interpretable by human operators. This approach evolves DRs with similar performance but smaller size. Fragment analysis identifies popular combinations of terminals which are then used as high level terminals; the inclusion of these terminals improved the mean performance of the best evolved DRs. Through this thesis the following major… Advisors/Committee Members: Zhang, Mengjie, Johnston, Mark.

Subjects/Keywords: Genetic Programming; Hyper-heuristics; Scheduling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hunt, R. (2016). Genetic Programming Hyper-heuristics for Job Shop Scheduling. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/5219

Chicago Manual of Style (16^th Edition):

Hunt, Rachel. “Genetic Programming Hyper-heuristics for Job Shop Scheduling.” 2016. Doctoral Dissertation, Victoria University of Wellington. Accessed February 26, 2021. http://hdl.handle.net/10063/5219.

MLA Handbook (7^th Edition):

Hunt, Rachel. “Genetic Programming Hyper-heuristics for Job Shop Scheduling.” 2016. Web. 26 Feb 2021.

Vancouver:

Hunt R. Genetic Programming Hyper-heuristics for Job Shop Scheduling. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2016. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/10063/5219.

Council of Science Editors:

Hunt R. Genetic Programming Hyper-heuristics for Job Shop Scheduling. [Doctoral Dissertation]. Victoria University of Wellington; 2016. Available from: http://hdl.handle.net/10063/5219

Tampere University

12. Siipo, Helena. Heuristic Evaluation of a Medical Device Prototype .

Degree: 2019, Tampere University

URL: https://trepo.tuni.fi/handle/10024/118428

► Usability principles are often secondary to clinical effectiveness when assessing medical devices. However, the majority of medical device incidents are linked to user error. Greater… (more)

Subjects/Keywords: heuristics; medical device; facial palsy

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Siipo, H. (2019). Heuristic Evaluation of a Medical Device Prototype . (Masters Thesis). Tampere University. Retrieved from https://trepo.tuni.fi/handle/10024/118428

Chicago Manual of Style (16^th Edition):

Siipo, Helena. “Heuristic Evaluation of a Medical Device Prototype .” 2019. Masters Thesis, Tampere University. Accessed February 26, 2021. https://trepo.tuni.fi/handle/10024/118428.

MLA Handbook (7^th Edition):

Siipo, Helena. “Heuristic Evaluation of a Medical Device Prototype .” 2019. Web. 26 Feb 2021.

Vancouver:

Siipo H. Heuristic Evaluation of a Medical Device Prototype . [Internet] [Masters thesis]. Tampere University; 2019. [cited 2021 Feb 26]. Available from: https://trepo.tuni.fi/handle/10024/118428.

Council of Science Editors:

Siipo H. Heuristic Evaluation of a Medical Device Prototype . [Masters Thesis]. Tampere University; 2019. Available from: https://trepo.tuni.fi/handle/10024/118428

13. Jonsson, Hanna. Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå.

Degree: Mathematics and Mathematical Statistics, 2016, Umeå University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-123343

►

Volvo Group’s cab plant in Umeå produces cab bodies and consists of three operating areas; the Stamping and parts production, the Body in White… (more)

▼

Volvo Group’s cab plant in Umeå produces cab bodies and consists of three operating areas; the Stamping and parts production, the Body in White and the Paint shop. Today the plant produces around XXX cabs/week, but the goal is to reach the invested capacity of XXX cabs/week. In order to increase the production capacity, the efficiency of both the manual and the automated processes need to be improved. Unlike the manual processes in where the capacity can be increased by enlarged workforce, the automated processes need to be optimized. Today the cabs are produced in the same order as the orders are received. The cab plant wants to investigate if the capacity of the automated segment in the Body in White unit can be increased by changing the order in the production sequence. This culminates in the following problem definition: Is there untapped potential of the Body in White that can be achieved by an optimization of the production sequence? If so, how can Volvo Group’s cab plant in Umeå utilize this knowledge in the production planning process? The objective of the project was achieved by combining discrete event simulation with a heuristic optimization approach. The results shows that long batches in the production sequence limit the throughput of the system. By spreading the unfavorable subsequences of batches evenly over the production sequence, the total throughput of the Body in White can be increased by 52 cabs/week.

Volvokoncernens hyttfabrik i Umeå producerar förarhytter och är uppdelad i tre driftsområden; pressning och detaljtillverkning, hyttsammansättning och ytbehandling. Idag producerar fabriken ca XXX hytter/vecka, men möjlighet finns att nå upp till den investerade kapaciteten på XXX hytter/vecka. För att kunna öka produktionskapaciteten behöver både de manuella och de automatiserade processerna effektiviseras. Till skillnad från de manuella processerna, där kapaciteten kan ökas genom att öka antalet operatörer, behöver de automatiserade processerna optimeras. Idag produceras hytterna i samma ordning som beställningarna kommer in. Hyttfabriken vill undersöka om det finns en möjlighet att öka kapaciteten för den automatiserade processen i Body in White genom att optimera produktionssekvensen. Detta leder fram till följande problemformulering: Finns det outnyttjad potential i Body in White som kan uppnås genom att optimera produktionssekvensen? Hur kan Volvokoncernens hyttfabrik i Umeå utnyttja denna kunskap vid planering av produktionen? Målet med projektet har uppnåtts genom att kombinera diskret händelsesimulering med optimering genom heuristiker. Resultatet visar att stora batcher av samma variant i produktionen begränsar genomströmningen i processen. Genom att bland annat sprida ut de ogynnsamma delsekvenserna jämnt över produktionssekvensen kan den totala genomströmningen i Body in White ökas med 52 hytter/vecka.

Subjects/Keywords: production sequence; sequencing; simulation; heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jonsson, H. (2016). Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-123343

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Jonsson, Hanna. “Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå.” 2016. Thesis, Umeå University. Accessed February 26, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-123343.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Jonsson, Hanna. “Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå.” 2016. Web. 26 Feb 2021.

Vancouver:

Jonsson H. Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå. [Internet] [Thesis]. Umeå University; 2016. [cited 2021 Feb 26]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-123343.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jonsson H. Optimization of the Cab Production Sequence : A simulation-based study at Volvo Group Trucks' cab plant in Umeå. [Thesis]. Umeå University; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-123343

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

14. Sikkes, Louis (author). Performance Evaluation of Vehicle Routing Heuristics.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:5c6b7284-99bc-41ab-bca5-4aeddb677b4e

► This thesis has researched the automation of performance evaluation of vehicle routing heuristics. The trade-off between solution quality, which is composed of multiple variables, and… (more)

Subjects/Keywords: heuristics; performance evaluation; anomaly detection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sikkes, L. (. (2019). Performance Evaluation of Vehicle Routing Heuristics. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:5c6b7284-99bc-41ab-bca5-4aeddb677b4e

Chicago Manual of Style (16^th Edition):

Sikkes, Louis (author). “Performance Evaluation of Vehicle Routing Heuristics.” 2019. Masters Thesis, Delft University of Technology. Accessed February 26, 2021. http://resolver.tudelft.nl/uuid:5c6b7284-99bc-41ab-bca5-4aeddb677b4e.

MLA Handbook (7^th Edition):

Sikkes, Louis (author). “Performance Evaluation of Vehicle Routing Heuristics.” 2019. Web. 26 Feb 2021.

Vancouver:

Sikkes L(. Performance Evaluation of Vehicle Routing Heuristics. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Feb 26]. Available from: http://resolver.tudelft.nl/uuid:5c6b7284-99bc-41ab-bca5-4aeddb677b4e.

Council of Science Editors:

Sikkes L(. Performance Evaluation of Vehicle Routing Heuristics. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:5c6b7284-99bc-41ab-bca5-4aeddb677b4e

University of Illinois – Urbana-Champaign

15. Horne, Zachary S. The influence of an inherence heuristic on scientific explanation.

Degree: PhD, Psychology, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/98226

► Although scientific reasoning is usually deliberate, it may also be influenced by the intuitive processes involved in everyday reasoning. Here, I investigated whether explanatory heuristic… (more)

Subjects/Keywords: Explanation; Psychology; Reasoning; Heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Horne, Z. S. (2017). The influence of an inherence heuristic on scientific explanation. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98226

Chicago Manual of Style (16^th Edition):

Horne, Zachary S. “The influence of an inherence heuristic on scientific explanation.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed February 26, 2021. http://hdl.handle.net/2142/98226.

MLA Handbook (7^th Edition):

Horne, Zachary S. “The influence of an inherence heuristic on scientific explanation.” 2017. Web. 26 Feb 2021.

Vancouver:

Horne ZS. The influence of an inherence heuristic on scientific explanation. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/2142/98226.

Council of Science Editors:

Horne ZS. The influence of an inherence heuristic on scientific explanation. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98226

University of Southern California

16. Mu, Shi. Minimizing congestion on railway networks.

Degree: PhD, Industrial and Systems Engineering, 2011, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/630368/rec/4090

► The railway transportation is becoming more and more important to the whole transportation system. The railway transportation is cost-effective, energy-efficient and safe. The railway is… (more)

▼ The railway transportation is becoming more and more important to the whole transportation system. The railway transportation is cost-effective, energy-efficient and safe. The railway is a major method of transportation of freight and passengers in many countries. Given the fact that the railway industry is facing rapid increasing demand, better planning and scheduling tools are needed to effectively manage the scarce resources. In this thesis, we focus on developing train scheduling and train dispatching algorithms that minimize the congestions on railway networks. ❧ The first part of this thesis studies the freight train scheduling problem. We develop optimization-based approaches for scheduling of freight trains. Two mathematical formulations of the scheduling problem are first introduced. Two heuristics based on mixtures of the two formulations are proposed. The proposed algorithms are able to perform better than two existing heuristics such as a simple look-ahead greedy heuristic and global neighborhood search algorithms, in terms of total train delay. For relatively large networks, two algorithms based on the idea of decomposition are proposed. We use two sample networks to test our proposed decomposition algorithms. The two sample networks are 33.9-mile and 49.3-mile long, respectively. Our decomposition algorithms are shown to outperform the two existing algorithms. ❧ The second part of the thesis studies the train dispatching problem for double-track and triple-track railway segment. The regular dedicated dispatching policy dedicates one track for trains travelling in one direction. If trains are travelling at different speeds, the faster train will catch up with the slower train thus be delayed. We first look at the problem where there are only two train speeds in the network, we propose a switchable dispatching policy for the double-track segment to reduce the chance that a faster train being blocked by a slower train. We use queueing theories to derive the delay functions. The new switchable dispatching policy is shown to significantly reduce the train delays compared to a dedicated policy. We also study the effect of having a crossover at the middle of the track segment. The switchable policy is then extended to the triple-track segment. Several variations of the switchable policy for triple-track segment are studied. Finally, we study the double-track segment dispatching policy for multiple train speeds. Advisors/Committee Members: Dessouky, Maged M. (Committee Chair), Ordonez, Fernando I. (Committee Member), Giuliano, Genevieve (Committee Member).

Subjects/Keywords: train; optimization; scheduling; heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mu, S. (2011). Minimizing congestion on railway networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/630368/rec/4090

Chicago Manual of Style (16^th Edition):

Mu, Shi. “Minimizing congestion on railway networks.” 2011. Doctoral Dissertation, University of Southern California. Accessed February 26, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/630368/rec/4090.

MLA Handbook (7^th Edition):

Mu, Shi. “Minimizing congestion on railway networks.” 2011. Web. 26 Feb 2021.

Vancouver:

Mu S. Minimizing congestion on railway networks. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2021 Feb 26]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/630368/rec/4090.

Council of Science Editors:

Mu S. Minimizing congestion on railway networks. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/630368/rec/4090

Louisiana State University

17. Acklin, Dina. Cognitive bias and learning from experience: Reflective processes for reducing bias.

Degree: MA, Psychology, 2014, Louisiana State University

URL: etd-02202015-161715 ; https://digitalcommons.lsu.edu/gradschool_theses/2335

► While heuristic processing is often useful for quickly ascertaining information in everyday situations, it can lead to inaccuracies when task demands become complex and more… (more)

Subjects/Keywords: heuristics; confirmation bias; decision making

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Acklin, D. (2014). Cognitive bias and learning from experience: Reflective processes for reducing bias. (Masters Thesis). Louisiana State University. Retrieved from etd-02202015-161715 ; https://digitalcommons.lsu.edu/gradschool_theses/2335

Chicago Manual of Style (16^th Edition):

Acklin, Dina. “Cognitive bias and learning from experience: Reflective processes for reducing bias.” 2014. Masters Thesis, Louisiana State University. Accessed February 26, 2021. etd-02202015-161715 ; https://digitalcommons.lsu.edu/gradschool_theses/2335.

MLA Handbook (7^th Edition):

Acklin, Dina. “Cognitive bias and learning from experience: Reflective processes for reducing bias.” 2014. Web. 26 Feb 2021.

Vancouver:

Acklin D. Cognitive bias and learning from experience: Reflective processes for reducing bias. [Internet] [Masters thesis]. Louisiana State University; 2014. [cited 2021 Feb 26]. Available from: etd-02202015-161715 ; https://digitalcommons.lsu.edu/gradschool_theses/2335.

Council of Science Editors:

Acklin D. Cognitive bias and learning from experience: Reflective processes for reducing bias. [Masters Thesis]. Louisiana State University; 2014. Available from: etd-02202015-161715 ; https://digitalcommons.lsu.edu/gradschool_theses/2335

Virginia Tech

18. Monk, Monika Patrice. Mobile Exergaming Heuristics.

Degree: MS, Computer Science and Applications, 2014, Virginia Tech

URL: http://hdl.handle.net/10919/50581

► An alarming number of adolescents experience obesity and related health issues, in part because of a lack of exercise. Increased mobile technology availability can have… (more)

Subjects/Keywords: Mobile exergaming; mobile design; heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Monk, M. P. (2014). Mobile Exergaming Heuristics. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/50581

Chicago Manual of Style (16^th Edition):

Monk, Monika Patrice. “Mobile Exergaming Heuristics.” 2014. Masters Thesis, Virginia Tech. Accessed February 26, 2021. http://hdl.handle.net/10919/50581.

MLA Handbook (7^th Edition):

Monk, Monika Patrice. “Mobile Exergaming Heuristics.” 2014. Web. 26 Feb 2021.

Vancouver:

Monk MP. Mobile Exergaming Heuristics. [Internet] [Masters thesis]. Virginia Tech; 2014. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/10919/50581.

Council of Science Editors:

Monk MP. Mobile Exergaming Heuristics. [Masters Thesis]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/50581

University of Cambridge

19. Li, Sai. Costs analysis and the role of heuristics in fairness.

Degree: PhD, 2018, University of Cambridge

URL: https://doi.org/10.17863/CAM.18901 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744532

► Although numerous theoretical traditions postulate that human fairness depends on the ratio of costs-to-benefits, theory and empirical data remain divided on the direction of the… (more)

▼ Although numerous theoretical traditions postulate that human fairness depends on the ratio of costs-to-benefits, theory and empirical data remain divided on the direction of the effect. Particularly, answers to the following questions have remained unclear: how cost/benefit ratios affect people’s fairness decision-making during resource allocations, how cost/benefit ratios affect people’s emotions and cognition when they receive fair or unfair treatments, whether people are intuitively selfish or fair, and how cost/benefit ratios of sharing affect it. To address these questions, I conducted three lines of studies in Chapters 2 to 4 of this dissertation. In Chapter 2, I examined how cost/benefit ratios of sharing affect people to make fair or unfair decisions in resource allocations. Results showed that more participants acted fairly when the costs were equal to the benefits as compared to when the costs were higher or lower than the benefits. Shifting from resource dividers to receivers, in Chapter 3 I tested people’s emotional responses and cognitive judgements when they receive fair or unfair treatments at different cost/benefit ratios. My findings revealed that people felt more negative under unfair treatments when the costs were equal to the benefits as compared to when the costs were higher or lower than the benefits. Findings from Chapter 2 and 3 suggested an even-split heuristic: When the costs were equal to the benefits and thus the even-split was fair, more people tended to make fair decisions, and people felt more negative about receiving an unfair offer. Building on these findings, Chapter 4 tested the even-split heuristic using a fast-slow dual process framework and proposed the Value-Heuristic Framework. Results in Chapter 4 showed that people took the shortest time to make the even-and-fair decision (i.e., the even-split was also fair). I also found that people took longer to make the even-but-not-fair decision (i.e., giving an even-split, which results in uneven payoffs), and the longest time to make the not-even-but-fair decision (i.e., giving an uneven-split that results in even payoffs). Based upon the overall findings from my three empirical chapters. I formulated a conceptual framework for explaining and predicting people’s fairness decision-making.

Subjects/Keywords: 152.4; Cost/benefit; Fairness; Heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Li, S. (2018). Costs analysis and the role of heuristics in fairness. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.18901 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744532

Chicago Manual of Style (16^th Edition):

Li, Sai. “Costs analysis and the role of heuristics in fairness.” 2018. Doctoral Dissertation, University of Cambridge. Accessed February 26, 2021. https://doi.org/10.17863/CAM.18901 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744532.

MLA Handbook (7^th Edition):

Li, Sai. “Costs analysis and the role of heuristics in fairness.” 2018. Web. 26 Feb 2021.

Vancouver:

Li S. Costs analysis and the role of heuristics in fairness. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2021 Feb 26]. Available from: https://doi.org/10.17863/CAM.18901 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744532.

Council of Science Editors:

Li S. Costs analysis and the role of heuristics in fairness. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://doi.org/10.17863/CAM.18901 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.744532

University of Oklahoma

20. Carlson, Benjamin. Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms.

Degree: PhD, 2016, University of Oklahoma

URL: http://hdl.handle.net/11244/34654

► Many approaches to applying Genetic Algorithms (GAs) to Nondeterministic Polynomial time Complete (NPC) problems involve population members encoded directly from the problem solution space. While… (more)

▼ Many approaches to applying Genetic Algorithms (GAs) to Nondeterministic Polynomial time Complete (NPC) problems involve population members encoded directly from the problem solution space. While this technique enables trivial mapping of the population members to solutions, it can cause complex problems for GA operators as they attempt to direct the evolution of the population toward more promising areas of the solution space. These operators, using inspiration from genetics and evolution in the biological world, combine and manipulate the current population to produce a new population that, it is hoped, will eventually converge toward better solutions to the original problem. However, many problems, especially graph-space problems, cannot be so easily manipulated when GA members consist of direct encodings. In such cases, GA operators must perform awkward transformations to convert the progeny into viable solutions. Here is where heuristic encoding comes into play, in that any combination of genes will produce a viable solution. However, this additional level of abstraction does cause other problems and tends to weaken the guiding effects of traditional GA operators. Thus, I have designed custom GA operators that mitigate these problems by using the solutions produced by the heuristic encoded members to better guide the manipulation when producing the next generation. This dissertation shows that heuristic encoding is an effective technique for the representation of solutions to graph-space problems. It also shows that, when using heuristic encoding, GAs with traditional operators perform well compared to more direct encoding techniques. Finally it shows the combination of heuristic encoding and GA operators designed to work with them increases GA performance and can be competitive with other techniques. I believe that these techniques will also work well for other types of problems for which GAs are commonly applied. Advisors/Committee Members: Hougen, Dean (advisor), Havlicek, Joseph (committee member), Atiquzzaman, Mohammed (committee member), Cheng, Samuel (committee member), Radhakrishnan, Sridhar (committee member).

Subjects/Keywords: Heuristics; Genetic Algorithms; Evolutionary Computation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Carlson, B. (2016). Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/34654

Chicago Manual of Style (16^th Edition):

Carlson, Benjamin. “Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms.” 2016. Doctoral Dissertation, University of Oklahoma. Accessed February 26, 2021. http://hdl.handle.net/11244/34654.

MLA Handbook (7^th Edition):

Carlson, Benjamin. “Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms.” 2016. Web. 26 Feb 2021.

Vancouver:

Carlson B. Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms. [Internet] [Doctoral dissertation]. University of Oklahoma; 2016. [cited 2021 Feb 26]. Available from: http://hdl.handle.net/11244/34654.

Council of Science Editors:

Carlson B. Phenotype Operators for Improved Performance of Heuristic Encoding Within Genetic Algorithms. [Doctoral Dissertation]. University of Oklahoma; 2016. Available from: http://hdl.handle.net/11244/34654

University of Tennessee – Knoxville

21. Bajpai, Abhay Ranjendra. Zone-based Manufacturing.

Degree: MS, Industrial Engineering, 2020, University of Tennessee – Knoxville

URL: https://trace.tennessee.edu/utk_gradthes/5655

► The biggest improvement possible with productivity and profit in a manufacturing environment is to decrease the production time or cycle time and increase the takt… (more)

Subjects/Keywords: scheduling; optimization; heuristics; manufacturing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bajpai, A. R. (2020). Zone-based Manufacturing. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/5655

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bajpai, Abhay Ranjendra. “Zone-based Manufacturing.” 2020. Thesis, University of Tennessee – Knoxville. Accessed February 26, 2021. https://trace.tennessee.edu/utk_gradthes/5655.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bajpai, Abhay Ranjendra. “Zone-based Manufacturing.” 2020. Web. 26 Feb 2021.

Vancouver:

Bajpai AR. Zone-based Manufacturing. [Internet] [Thesis]. University of Tennessee – Knoxville; 2020. [cited 2021 Feb 26]. Available from: https://trace.tennessee.edu/utk_gradthes/5655.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bajpai AR. Zone-based Manufacturing. [Thesis]. University of Tennessee – Knoxville; 2020. Available from: https://trace.tennessee.edu/utk_gradthes/5655

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

22. Lyons, David James. EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING .

Degree: 2013, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/19745

► The overall objective of this research was to develop and test an automated selective fruit-thinning system for blossom removal in a peach tree orchard. The… (more)

▼ The overall objective of this research was to develop and test an automated selective fruit-thinning system for blossom removal in a peach tree orchard. The proposed system needed to visualize the tree fruit canopy, discriminate targets, mechanically reach the canopy from a stable platform and remove unwanted targets. The experimental system consisted of: vision acquisition hardware, kinematic targeting and heuristic programming, a robotic arm and a pomologically designed end-effector. A quarter-scale robotic arm based on a Fanuc M-16Li robotic arm was designed and constructed. The robotic arm had a payload of 2.5 kg (5.5 lbs) and was mounted on a test plate and platform configuration for study. The robotic arm could deliver a torque greater than 44 N (10 lbf) at a target location. A rotating brush end-effector was also designed and fabricated. The end-effector had a measured tangential force capability of 5.3 N (1.19 lbf ) at the brush blossom interface. The normal and tangential force requirements to remove a peach blossom from a shoot were evaluated. The resultant of the blossom force tests gave a range of 0.44 N to 0.57 N (0.10 lbf - 0.13 lbf) for the normal force and 0.49 N to 0.71 N (0.11 - 0.16 lbf) for the tangential force. Both force ranges were orders of magnitude lower than the deliverable force of the system. Thus, the robotic arm with end-effector combination could effectively remove peach buds and/or blossoms from a branch or shoot configuration. The precision and accuracy of the robotic arm and end-effector placement were also studied. A kinematic positioning test for the robotic arm consisted of 120 repetitions. The resultant 120 test repetitions fell within the first standard deviation of a proposed +/- 2.54 cm (1 in) precision standard. With a confidence level of 95% and a margin of error of +/- 8.96%, the robotic arm had a consistent range of -1.26 cm (0.496 in) to +1.57 cm (0.618 in) in vector magnitude per target location. For the end-effector positioning test the brushes reached the proposed +/- 2.54 cm (1 in) target area 100% of the time. The deviation from target to the center of the brushes was within the first standard deviation with a confidence level of 95% and a margin of error of +/- 10.33%, the end-effector brushes had a consistent range of -2.97 cm (-1.1 in) to +3.04 cm (+1.2 in) per target location. For the heuristic thinning tests of 10 cm (3.93 in), 15 cm (5.90 in) and 20 cm (7.87 in) the end-effector successfully removed the unwanted blossom in each case. The blossom thinning percentage for each case was 100%. In conclusion, a quarter-scale robotic arm and full scale end-effector was designed and built. A system of the robotic arm, end-effector, heuristic and kinematic algorithms was successfully integrated. The robotic arm maneuvered without the end-effector to the respective targets +/- 2.54 cm (1 in) no less than 95% of each test case. The robotic arm maneuvered with the end-effector to the respective targets +/- 2.54 cm (1 in) no less than 95% of each… Advisors/Committee Members: Paul Heinz Heinemann, Dissertation Advisor/Co-Advisor, Paul Heinz Heinemann, Committee Chair/Co-Chair, Jude Liu, Committee Member, James Rawlinson Schupp, Special Member, Virendra Puri, Committee Member.

Subjects/Keywords: Pomological End-Effector; Peach Thinning; Saturn Blossom Heuristics; Peach Thinning Heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lyons, D. J. (2013). EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING . (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/19745

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lyons, David James. “EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING .” 2013. Thesis, Penn State University. Accessed February 26, 2021. https://submit-etda.libraries.psu.edu/catalog/19745.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lyons, David James. “EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING .” 2013. Web. 26 Feb 2021.

Vancouver:

Lyons DJ. EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING . [Internet] [Thesis]. Penn State University; 2013. [cited 2021 Feb 26]. Available from: https://submit-etda.libraries.psu.edu/catalog/19745.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lyons DJ. EXPERIMENTAL INVESTIGATION OF SELECTIVE AUTOMATED PEACH (PRUNUS PERSICA (L.) BATSCH) BLOSSOM THINNING . [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/19745

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

23. Zhao, Xiagang. Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems.

Degree: Docteur es, Informatique, 2011, Université Blaise-Pascale, Clermont-Ferrand II

URL: http://www.theses.fr/2011CLF22125

►

Dans le cadre de cette thèse, nous nous intéressons au problème du transport à la demande. Nous proposons des heuristiques pour résoudre ce problème de… (more)

▼

Dans le cadre de cette thèse, nous nous intéressons au problème du transport à la demande. Nous proposons des heuristiques pour résoudre ce problème de manière rapide et efficace. Dans cette thèse, nous traitons trois problèmes : le premier est le Dial-a-ride (DARP standard). Pour ce problème, nous proposons des heuristiques basées sur la technique d’insertion et une technique de propagation de contrainte. Nous proposons aussi la procédure SPLIT et des opérateurs classiques de recherche locale pour résoudre ce problème. Le second est le DARP multicritères pour laquelle nous proposons un schéma de type ELS. Le troisième est un problème de transport à la demande avec contraintes financières (DARPF), qui est une extension de DARP. Nous résolvons ce problème grâce à une heuristique d’insertion et une technique de propagation de contraintes. La fonction objectif détermine les caractéristiques des tournées. Des résultats expérimentaux montrent que nos (méta-) heuristiques donnent des résultats plus favorables aux clients (meilleure qualité de service)

As part of this thesis, we investigate the vehicle routing problem. We propose heuristics to solve this problem quickly and efficiently. In this thesis, we deal with three problems: the first is the Dial-a-ride problem. For this problem, we propose heuristics based on the technique of insertion and a constraint propagation technique. We propose also the procedure SPLIT and some operators of local research to solve this problem. The second is the multi-criteria DARP for which we propose an ELS framework. The third is a DARP problem with financial constraints (DARPF), which is an extension of DARP. We solve this problem thanks to insertion heuristics using a constraint propagation technique. The objective function determines the characteristics of the tour. Experimental results show that our (meta-) heuristics give results more favorable to customers (better quality of service)

Advisors/Committee Members: Quilliot, Alain (thesis director).

Subjects/Keywords: Heuristique; Méta-heuristique; Transport; Ordonnancement; Heuristics; Meta-heuristics; Transportation; Scheduling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhao, X. (2011). Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems. (Doctoral Dissertation). Université Blaise-Pascale, Clermont-Ferrand II. Retrieved from http://www.theses.fr/2011CLF22125

Chicago Manual of Style (16^th Edition):

Zhao, Xiagang. “Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems.” 2011. Doctoral Dissertation, Université Blaise-Pascale, Clermont-Ferrand II. Accessed February 26, 2021. http://www.theses.fr/2011CLF22125.

MLA Handbook (7^th Edition):

Zhao, Xiagang. “Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems.” 2011. Web. 26 Feb 2021.

Vancouver:

Zhao X. Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems. [Internet] [Doctoral dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2011. [cited 2021 Feb 26]. Available from: http://www.theses.fr/2011CLF22125.

Council of Science Editors:

Zhao X. Algorithmes pour les problèmes de tournées à la demande : Algorithms for on-demand touring problems. [Doctoral Dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2011. Available from: http://www.theses.fr/2011CLF22125

Uppsala University

24. Rong, Huan. Developing Heuristics for Evaluating Online Recruitment Websites.

Degree: Human-Computer Interaction, 2019, Uppsala University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-421034

► With the increased use of online recruitment websites, many organizations have started building up these services to serve various kinds of users. There are… (more)

Subjects/Keywords: usability evaluation; usability heuristics; heuristics evaluation; developing heuristics; online recruitment; Human Computer Interaction; Människa-datorinteraktion (interaktionsdesign)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rong, H. (2019). Developing Heuristics for Evaluating Online Recruitment Websites. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-421034

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Rong, Huan. “Developing Heuristics for Evaluating Online Recruitment Websites.” 2019. Thesis, Uppsala University. Accessed February 26, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-421034.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Rong, Huan. “Developing Heuristics for Evaluating Online Recruitment Websites.” 2019. Web. 26 Feb 2021.

Vancouver:

Rong H. Developing Heuristics for Evaluating Online Recruitment Websites. [Internet] [Thesis]. Uppsala University; 2019. [cited 2021 Feb 26]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-421034.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rong H. Developing Heuristics for Evaluating Online Recruitment Websites. [Thesis]. Uppsala University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-421034

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Anna University

25. Arunkumar N. Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;.

Degree: multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/27971

►

In todays competitive operating environment it is impossible to newlinesuccessfully produce low cost high quality products without satisfactory newlinevendors Supplier selection is one of the… (more)

Subjects/Keywords: integer linear programming; mechanical engineering; meta heuristics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

N, A. (2014). Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27971

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

N, Arunkumar. “Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;.” 2014. Thesis, Anna University. Accessed February 26, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/27971.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

N, Arunkumar. “Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;.” 2014. Web. 26 Feb 2021.

Vancouver:

N A. Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Feb 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27971.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

N A. Optimization technique for multi objective supplier selection with quantity discounts using integer linear programming and meta heuristics;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27971

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universidade Nova

26. Kwiatkowski, Lukasz. Application of different heuristic classes in memory-based and stimulus-based decisions.

Degree: 2014, Universidade Nova

URL: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14907

►

This paper studies the drivers of heuristic application in different decision types. The study compares differences in frequencies of heuristic classes' such as recognition, one-reason… (more)

Subjects/Keywords: Heuristics; Memory-based; Stimulus-based; Involvement

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kwiatkowski, L. (2014). Application of different heuristic classes in memory-based and stimulus-based decisions. (Thesis). Universidade Nova. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14907

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kwiatkowski, Lukasz. “Application of different heuristic classes in memory-based and stimulus-based decisions.” 2014. Thesis, Universidade Nova. Accessed February 26, 2021. https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14907.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kwiatkowski, Lukasz. “Application of different heuristic classes in memory-based and stimulus-based decisions.” 2014. Web. 26 Feb 2021.

Vancouver:

Kwiatkowski L. Application of different heuristic classes in memory-based and stimulus-based decisions. [Internet] [Thesis]. Universidade Nova; 2014. [cited 2021 Feb 26]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14907.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kwiatkowski L. Application of different heuristic classes in memory-based and stimulus-based decisions. [Thesis]. Universidade Nova; 2014. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14907

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

27. Zhang, Wenbo. Decide vaccine prices and subsidies for developing countries.

Degree: Industrial and Systems Engineering, 2011, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/5701

► Vaccination has been deemed the most cost-effective way to fight against preventable diseases and improve global health. In recent years, expensive combination vaccines which provide… (more)

Subjects/Keywords: Heuristics; Optimization; Pricing; Social surplus; Subsidy; Vaccine

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhang, W. (2011). Decide vaccine prices and subsidies for developing countries. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/5701

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zhang, Wenbo. “Decide vaccine prices and subsidies for developing countries.” 2011. Thesis, Rochester Institute of Technology. Accessed February 26, 2021. https://scholarworks.rit.edu/theses/5701.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zhang, Wenbo. “Decide vaccine prices and subsidies for developing countries.” 2011. Web. 26 Feb 2021.

Vancouver:

Zhang W. Decide vaccine prices and subsidies for developing countries. [Internet] [Thesis]. Rochester Institute of Technology; 2011. [cited 2021 Feb 26]. Available from: https://scholarworks.rit.edu/theses/5701.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang W. Decide vaccine prices and subsidies for developing countries. [Thesis]. Rochester Institute of Technology; 2011. Available from: https://scholarworks.rit.edu/theses/5701

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Mississippi State University

28. Pirim, Harun. A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA.

Degree: PhD, Industrial and Systems Engineering, 2011, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;

► A new minimum spanning tree (MST) based heuristic for clustering biological data is proposed. The heuristic uses MSTs to generate initial solutions and applies… (more)

Subjects/Keywords: optimization; heuristics; networks; integer programming; clustering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pirim, H. (2011). A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;

Chicago Manual of Style (16^th Edition):

Pirim, Harun. “A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA.” 2011. Doctoral Dissertation, Mississippi State University. Accessed February 26, 2021. http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;.

MLA Handbook (7^th Edition):

Pirim, Harun. “A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA.” 2011. Web. 26 Feb 2021.

Vancouver:

Pirim H. A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA. [Internet] [Doctoral dissertation]. Mississippi State University; 2011. [cited 2021 Feb 26]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;.

Council of Science Editors:

Pirim H. A MINIMUM SPANNING TREE BASED CLUSTERING ALGORITHM FOR HIGH THROUGHPUT BIOLOGICAL DATA. [Doctoral Dissertation]. Mississippi State University; 2011. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03022011-155156/ ;

San Jose State University

29. Sim, Hoeun. The Effects of Discrete Emotions on Risky Decision Making.

Degree: MA, Psychology, 2016, San Jose State University

URL: https://doi.org/10.31979/etd.qpqx-9r59 ; https://scholarworks.sjsu.edu/etd_theses/4708

► Contrary to the dominant view that generally equates feelings with poor thinking, converging evidence indicates that decisions – including those involving risk – are… (more)

Subjects/Keywords: Affect; Decision Making; Emotion; Heuristics; Judgment; Risk

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sim, H. (2016). The Effects of Discrete Emotions on Risky Decision Making. (Masters Thesis). San Jose State University. Retrieved from https://doi.org/10.31979/etd.qpqx-9r59 ; https://scholarworks.sjsu.edu/etd_theses/4708

Chicago Manual of Style (16^th Edition):

Sim, Hoeun. “The Effects of Discrete Emotions on Risky Decision Making.” 2016. Masters Thesis, San Jose State University. Accessed February 26, 2021. https://doi.org/10.31979/etd.qpqx-9r59 ; https://scholarworks.sjsu.edu/etd_theses/4708.

MLA Handbook (7^th Edition):

Sim, Hoeun. “The Effects of Discrete Emotions on Risky Decision Making.” 2016. Web. 26 Feb 2021.

Vancouver:

Sim H. The Effects of Discrete Emotions on Risky Decision Making. [Internet] [Masters thesis]. San Jose State University; 2016. [cited 2021 Feb 26]. Available from: https://doi.org/10.31979/etd.qpqx-9r59 ; https://scholarworks.sjsu.edu/etd_theses/4708.

Council of Science Editors:

Sim H. The Effects of Discrete Emotions on Risky Decision Making. [Masters Thesis]. San Jose State University; 2016. Available from: https://doi.org/10.31979/etd.qpqx-9r59 ; https://scholarworks.sjsu.edu/etd_theses/4708

University of Alberta

30. Jabbari Arfaee, Shahab. Bootstrap Learning of Heuristic Functions.

Degree: MS, Department of Computing Science, 2010, University of Alberta

URL: https://era.library.ualberta.ca/files/p2676w277

► We investigate the use of machine learning to create effective heuristics for single-agent search. Our method aims to generate a sequence of heuristics from a… (more)

▼ We investigate the use of machine learning to create effective heuristics for single-agent search. Our method aims to generate a sequence of heuristics from a given weak heuristic h{0} and a set of unlabeled training instances using a bootstrapping procedure. The training instances that can be solved using h{0} provide training examples for a learning algorithm that produces a heuristic h{1} that is expected to be stronger than h{0}. If h{0} is so weak that it cannot solve any of the given instances we use random walks backward from the goal state to create a sequence of successively more difficult training instances starting with ones that are guaranteed to be solvable by h{0}. The bootstrap process is then repeated using h{i} instead of h{i-1} until a sufficiently strong heuristic is produced. We test this method on the 15- and 24-sliding tile puzzles, the 17- , 24- , and 35-pancake puzzles, Rubik's Cube, and the 15- and 20-blocks world. In every case our method produces heuristics that allow IDA* to solve randomly generated problem instances quickly with solutions very close to optimal. The total time for the bootstrap process to create strong heuristics for large problems is several days. To make the process efficient when only a single test instance needs to be solved, we look for a balance in the time spent on learning better heuristics and the time needed to solve the test instance using the current set of learned heuristics. %We use two threads in parallel, We alternate between the execution of two threads, namely the learning thread (to learn better heuristics) and the solving thread (to solve the test instance). The solving thread is split up into sub-threads. The first solving sub-thread aims at solving the instance using the initial heuristic. When a new heuristic is learned in the learning thread, an additional solving sub-thread is started which uses the new heuristic to try to solve the instance. The total time by which we evaluate this process is the sum of the times used by both threads up to the point when the instance is solved in one sub-thread. The experimental results of this method on large search spaces demonstrate that the single instance of large problems are solved substantially faster than the total time needed for the bootstrap process while the solutions obtained are still very close to optimal.

Subjects/Keywords: Learning Heuristics; Bootstrapping; Heuristic Search; Planning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jabbari Arfaee, S. (2010). Bootstrap Learning of Heuristic Functions. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/p2676w277

Chicago Manual of Style (16^th Edition):

Jabbari Arfaee, Shahab. “Bootstrap Learning of Heuristic Functions.” 2010. Masters Thesis, University of Alberta. Accessed February 26, 2021. https://era.library.ualberta.ca/files/p2676w277.

MLA Handbook (7^th Edition):

Jabbari Arfaee, Shahab. “Bootstrap Learning of Heuristic Functions.” 2010. Web. 26 Feb 2021.

Vancouver:

Jabbari Arfaee S. Bootstrap Learning of Heuristic Functions. [Internet] [Masters thesis]. University of Alberta; 2010. [cited 2021 Feb 26]. Available from: https://era.library.ualberta.ca/files/p2676w277.

Council of Science Editors:

Jabbari Arfaee S. Bootstrap Learning of Heuristic Functions. [Masters Thesis]. University of Alberta; 2010. Available from: https://era.library.ualberta.ca/files/p2676w277

Open Access Theses and Dissertations