Log in

Relevant bibliographies by topics / Mathematics Heuristic / Journal articles

To see the other types of publications on this topic, follow the link: Mathematics Heuristic.

Journal articles on the topic 'Mathematics Heuristic'

Author: Grafiati

Published: 4 June 2021

Last updated: 6 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Mathematics Heuristic.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

BOUZY, BRUNO. "HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO." New Mathematics and Natural Computation 02, no. 02 (2006): 139–46. http://dx.doi.org/10.1142/s1793005706000427.

Full text

Abstract:

Recently, the Monte Carlo approach has been applied to computer go with promising success. INDIGO uses such an approach which can be enhanced with specific heuristics. This paper assesses two heuristics within the 19 × 19 Monte Carlo go framework of INDIGO: the territory heuristic and the history heuristic, both in their internal and external versions. The external territory heuristic is more effective, leading to a 40-point improvement on 19 × 19 boards. The external history heuristic brings about a 10-point improvement. The internal territory heuristic yields a few points improvement, and th

APA, Harvard, Vancouver, ISO, and other styles

2

Lucas, J. F. "Heuristic Thinking and Mathematics." Humanistic Mathematics Network Journal 1, no. 5 (1990): 9–12. http://dx.doi.org/10.5642/hmnj.199001.05.05.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Drake, John H., Ender Özcan, and Edmund K. Burke. "A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem." Evolutionary Computation 24, no. 1 (2016): 113–41. http://dx.doi.org/10.1162/evco_a_00145.

Full text

Abstract:

Hyper-heuristics are high-level methodologies for solving complex problems that operate on a search space of heuristics. In a selection hyper-heuristic framework, a heuristic is chosen from an existing set of low-level heuristics and applied to the current solution to produce a new solution at each point in the search. The use of crossover low-level heuristics is possible in an increasing number of general-purpose hyper-heuristic tools such as HyFlex and Hyperion. However, little work has been undertaken to assess how best to utilise it. Since a single-point search hyper-heuristic operates on

APA, Harvard, Vancouver, ISO, and other styles

4

Hart, Emma, and Kevin Sim. "A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling." Evolutionary Computation 24, no. 4 (2016): 609–35. http://dx.doi.org/10.1162/evco_a_00183.

Full text

Abstract:

We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics composed of linear sequences of dispatching rules: each rule is represented using a tree structure and is itself evolved. Following a training period, the ensemble is shown to outperform both existing dispatc

APA, Harvard, Vancouver, ISO, and other styles

5

Ren, Zhilei, He Jiang, Jifeng Xuan, and Zhongxuan Luo. "Hyper-Heuristics with Low Level Parameter Adaptation." Evolutionary Computation 20, no. 2 (2012): 189–227. http://dx.doi.org/10.1162/evco_a_00063.

Full text

Abstract:

Recent years have witnessed the great success of hyper-heuristics applying to numerous real-world applications. Hyper-heuristics raise the generality of search methodologies by manipulating a set of low level heuristics (LLHs) to solve problems, and aim to automate the algorithm design process. However, those LLHs are usually parameterized, which may contradict the domain independent motivation of hyper-heuristics. In this paper, we show how to automatically maintain low level parameters (LLPs) using a hyper-heuristic with LLP adaptation (AD-HH), and exemplify the feasibility of AD-HH by adapt

APA, Harvard, Vancouver, ISO, and other styles

6

Hoon, Teoh Sian, Kor Liew Kee, and Parmjit Singh. "Learning Mathematics Using Heuristic Approach." Procedia - Social and Behavioral Sciences 90 (October 2013): 862–69. http://dx.doi.org/10.1016/j.sbspro.2013.07.162.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Зацепина, Ю. А., та Е. Е. Кирьянова. "Методика применения эвристических подходов при решении математических задач". ТЕНДЕНЦИИ РАЗВИТИЯ НАУКИ И ОБРАЗОВАНИЯ 70, № 2 (2021): 56–60. http://dx.doi.org/10.18411/lj-02-2021-53.

Full text

Abstract:

Taking into account the development of science and technology, the use of heuristic methods in the learning process is becoming popular for the development of thinking and logic. Heuristic methods in mathematics are not only something entertaining and fascinating, but also an effective tool for mastering the material and developing students ' logical thinking. The considered heuristic methods will simplify the solution of mathematical problems in the school mathematics course.

APA, Harvard, Vancouver, ISO, and other styles

8

Skafa, E. I. "Organization of project-heuristic activity of future mathematics teachers in creating multimedia teaching tools." Informatics and education, no. 5 (July 16, 2021): 59–64. http://dx.doi.org/10.32517/0234-0453-2021-36-5-59-64.

Full text

Abstract:

Now we can see a widespread introduction of modern digital technologies into the educational process in mathematics. These technologies can make learning more visual and accessible, implement an individual approach in teaching and manage the educationalcognitive heuristic activity of schoolchildren. The organization of project-heuristic activities in a higher pedagogical school can help prepare a future teacher for the development of computer-related tools. We refer to the means of digitalization of modern education as heuristic-didactic constructions in the form of computer programs for “non-

APA, Harvard, Vancouver, ISO, and other styles

9

Burke, Edmund K., Matthew R. Hyde, Graham Kendall, and John Woodward. "Automating the Packing Heuristic Design Process with Genetic Programming." Evolutionary Computation 20, no. 1 (2012): 63–89. http://dx.doi.org/10.1162/evco_a_00044.

Full text

Abstract:

The literature shows that one-, two-, and three-dimensional bin packing and knapsack packing are difficult problems in operational research. Many techniques, including exact, heuristic, and metaheuristic approaches, have been investigated to solve these problems and it is often not clear which method to use when presented with a new instance. This paper presents an approach which is motivated by the goal of building computer systems which can design heuristic methods. The overall aim is to explore the possibilities for automating the heuristic design process. We present a genetic programming s

APA, Harvard, Vancouver, ISO, and other styles

10

SWAN, JERRY, GABRIELA OCHOA, GRAHAM KENDALL, and MARTIN EDJVET. "FITNESS LANDSCAPES AND THE ANDREWS–CURTIS CONJECTURE." International Journal of Algebra and Computation 22, no. 02 (2012): 1250009. http://dx.doi.org/10.1142/s0218196711006753.

Full text

Abstract:

Attempts have been made to eliminate some potential counterexamples to the Andrews–Curtis conjecture using the combinatorial optimization methods of blind-search and the genetic algorithms meta-heuristic. Breadth-first search with secondary storage is currently the most successful method, which raises questions regarding the inferior performance of heuristic search. In order to understand the underlying reasons we obtain fitness landscape metrics for a number of balanced presentations and draw conclusions regarding the likely effectiveness of other meta-heuristics.

APA, Harvard, Vancouver, ISO, and other styles

11

Castillo-Villar, Krystel K., Rosa G. González-Ramírez, Pablo Miranda González, and Neale R. Smith. "A Heuristic Procedure for a Ship Routing and Scheduling Problem with Variable Speed and Discretized Time Windows." Mathematical Problems in Engineering 2014 (2014): 1–13. http://dx.doi.org/10.1155/2014/750232.

Full text

Abstract:

This paper develops a heuristic algorithm for solving a routing and scheduling problem for tramp shipping with discretized time windows. The problem consists of determining the set of cargoes that should be served by each ship, the arrival, departure, and waiting times at each port, while minimizing total costs. The heuristic proposed is based on a variable neighborhood search, considering a number of neighborhood structures to find a solution to the problem. We present computational results, and, for comparison purposes, we consider instances that can be solved directly by CPLEX to test the p

APA, Harvard, Vancouver, ISO, and other styles

12

Gordon, Marshall. "Teaching Mathematics: Heuristics Can and Ought to Lead the Way." Journal of Humanistic Mathematics 11, no. 2 (2021): 392–404. http://dx.doi.org/10.5642/jhummath.202102.22.

Full text

Abstract:

In contrast to problem-solving procedures that are the “bricks and mortar” of demonstrations in mathematics textbooks, heuristics, defined by Polya as “the study of means and methods of problem solving”, are those mental actions that enable the practitioner to make progress when it is not clear how to solve problems directly. Yet, as essential as heuristic tools are, they tend not to be included in presentations in mathematics textbooks. The overarching problem can be understood in terms of students’ not developing productive means for engaging problems. A few mathematics problems are included

APA, Harvard, Vancouver, ISO, and other styles

13

Kainen, Paul C. "The role of mathematics in heuristic performance." Behavioral and Brain Sciences 23, no. 5 (2000): 755–56. http://dx.doi.org/10.1017/s0140525x00383443.

Full text

Abstract:

A mathematical approach to heuristics is proposed, in contrast to Gigerenzer et al.'s assertion that laws of logic and probability are of little importance. Examples are given of effective heuristics in abstract settings. Other short-comings of the text are discussed, including omissions in psychophysics and cognitive science. However, the authors' ecological view is endorsed.

APA, Harvard, Vancouver, ISO, and other styles

14

Hobilla, Ma Aletha V., and Belinda M. Go. "Heuristic: Its Influence to the Mathematics Anxiety and Coping Mechanism." Proceedings Journal of Interdisciplinary Research 2 (October 10, 2015): 192–99. http://dx.doi.org/10.21016/irrc.2015.ma23wf40o.

Full text

Abstract:

This is a quantitative-qualitative study that aims to determine the influence of heuristic or problem-solving strategies (PS) to the mathematics anxiety of 97 or 87% of the Bachelor of Elementary Education (BEEd) second-year students of Western Visayas College of Science and Technology enrolled in the subject Problem Solving during the second semester, SY 2014-2015. It also aims to find out the coping mechanisms and perceived causes of mathematics anxiety of the participants. For the quantitative data, a one-group pretest-posttest design was used. The Mathematics Anxiety-Apprehension Survey (M

APA, Harvard, Vancouver, ISO, and other styles

15

Xu, Yan-xin. "An Efficient Heuristic Approach for Irregular Cutting Stock Problem in Ship Building Industry." Mathematical Problems in Engineering 2016 (2016): 1–12. http://dx.doi.org/10.1155/2016/8703782.

Full text

Abstract:

This paper presents an efficient approach for solving a real two-dimensional irregular cutting stock problem in ship building industry. Cutting stock problem is a common cutting and packing problem that arises in a variety of industrial applications. A modification of selection heuristic Exact Fit is applied in our research. In the case referring to irregular shapes, a placement heuristics is more important to construct a complete solution. A placement heuristic relating to bottom-left-fill is presented. We evaluate the proposed approach using generated instance only with convex shapes in lite

APA, Harvard, Vancouver, ISO, and other styles

16

Sabre, Ru Michael. "Mathematics and Peirce’s semiotic." Semiotica 2015, no. 207 (2015): 175–83. http://dx.doi.org/10.1515/sem-2015-0061.

Full text

Abstract:

AbstractIt is shown here that Peirce’s ten trichotomies, specifically art as discussed in Sabre (2014), provides a structure for presenting a mathematical conjecture and provide a heuristic for going about attempting a mathematical proof of the conjecture. The mathematics is presented through the work of the mathematical proof theorists George Polya and Daniel Solow. Here a geometric conjecture is shown to be true using a ten trichotomy context for a proof. Thus through the structure of mathematical proof the ten trichotomy structure validates itself.

APA, Harvard, Vancouver, ISO, and other styles

17

Mann, Zoltán, András Orbán, and Viktor Farkas. "Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning." International Journal of Applied Mathematics and Computer Science 17, no. 2 (2007): 249–67. http://dx.doi.org/10.2478/v10006-007-0022-3.

Full text

Abstract:

Evaluating the Kernighan-Lin Heuristic for Hardware/Software PartitioningIn recent years, several heuristics have been proposed for the hardware/software partitioning problem. One of the most promising directions is the adaptation of the Kernighan-Lin algorithm. The Kernighan-Lin heuristic was originally developed for circuit partitioning, but it has been adapted to other domains as well. Moreover, numerous improvements have been suggested so that now several variants of the original algorithm exist. The aim of this paper is to systematically evaluate the possibilities of applying the Kernigha

APA, Harvard, Vancouver, ISO, and other styles

18

Erkol, Şirag, and Gönenç Yücel. "Influence maximization based on partial network structure information: A comparative analysis on seed selection heuristics." International Journal of Modern Physics C 28, no. 10 (2017): 1750122. http://dx.doi.org/10.1142/s0129183117501224.

Full text

Abstract:

In this study, the problem of seed selection is investigated. This problem is mainly treated as an optimization problem, which is proved to be NP-hard. There are several heuristic approaches in the literature which mostly use algorithmic heuristics. These approaches mainly focus on the trade-off between computational complexity and accuracy. Although the accuracy of algorithmic heuristics are high, they also have high computational complexity. Furthermore, in the literature, it is generally assumed that complete information on the structure and features of a network is available, which is not

APA, Harvard, Vancouver, ISO, and other styles

19

Zhou, Hongming, Ya-Chih Tsai, Ful-Chiang Wu, Shenquan Huang, and Fuh-Der Chou. "Improved Approaches to Minimize the Makespan on Single-Machine Scheduling with Periodic Preventive Maintenance Activities." Mathematical Problems in Engineering 2020 (April 22, 2020): 1–13. http://dx.doi.org/10.1155/2020/8548463.

Full text

Abstract:

This paper addresses a single-machine scheduling problem with periodic preventive maintenance activities that are predeterministic so that the machine is not available all the time, and jobs have to be processed between two consecutive maintenance periods. We propose a mixed integer programming (MIP) model and two heuristics to minimize the makespan. With more constraints in our model, the model is more efficient than the recent model of Perez-Gonzalez and Framinan , and our model could solve problems with up to fifty jobs. Two heuristic algorithms, namely, H (MW) and H (LB∗), are also propose

APA, Harvard, Vancouver, ISO, and other styles

20

Lissovoi, Andrei, Pietro S. Oliveto, and John Alasdair Warwicker. "Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes." Evolutionary Computation 28, no. 3 (2020): 437–61. http://dx.doi.org/10.1162/evco_a_00258.

Full text

Abstract:

Selection hyper-heuristics (HHs) are randomised search methodologies which choose and execute heuristics during the optimisation process from a set of low-level heuristics. A machine learning mechanism is generally used to decide which low-level heuristic should be applied in each decision step. In this article, we analyse whether sophisticated learning mechanisms are always necessary for HHs to perform well. To this end we consider the most simple HHs from the literature and rigorously analyse their performance for the LeadingOnes benchmark function. Our analysis shows that the standard Simpl

APA, Harvard, Vancouver, ISO, and other styles

21

Novitasari, Nindya Tifa, and Ali Shodikin. "Pengaruh Penerapan Model Pembelajaran Logan Avenue Problem Solving (LAPS-Heuristik) terhadap Kemampuan Pemecahan Masalah pada Soal Cerita Barisan dan Deret Aritmetika." Jurnal Tadris Matematika 3, no. 2 (2020): 153–62. http://dx.doi.org/10.21274/jtm.2020.3.2.153-162.

Full text

Abstract:

The poor problem solving abilities of students is still a scourge in mathematics learning, mainly in terms of solving mathematical story problems. This is because in the case of story problems, students are required to understand the information and the questions in mathematical problems at the beginning in order to create a mathematical model which reflects the problem being solved. This study aimed to examine the achievement and improvement of students’ abilities in solving mathematical story problems about arithmetic sequences and series using LAPS-Heuristic learning model. The study method

APA, Harvard, Vancouver, ISO, and other styles

22

Chen, Ruey-Maw, and Chuin-Mu Wang. "Project Scheduling Heuristics-Based Standard PSO for Task-Resource Assignment in Heterogeneous Grid." Abstract and Applied Analysis 2011 (2011): 1–20. http://dx.doi.org/10.1155/2011/589862.

Full text

Abstract:

The task scheduling problem has been widely studied for assigning resources to tasks in heterogeneous grid environment. Effective task scheduling is an important issue for the performance of grid computing. Meanwhile, the task scheduling problem is an NP-complete problem. Hence, this investigation introduces a named “standard“ particle swarm optimization (PSO) metaheuristic approach to efficiently solve the task scheduling problems in grid. Meanwhile, two promising heuristics based on multimode project scheduling are proposed to help in solving interesting scheduling problems. They are the bes

APA, Harvard, Vancouver, ISO, and other styles

23

Sim, Kevin, Emma Hart, and Ben Paechter. "A Lifelong Learning Hyper-heuristic Method for Bin Packing." Evolutionary Computation 23, no. 1 (2015): 37–67. http://dx.doi.org/10.1162/evco_a_00121.

Full text

Abstract:

We describe a novel hyper-heuristic system that continuously learns over time to solve a combinatorial optimisation problem. The system continuously generates new heuristics and samples problems from its environment; and representative problems and heuristics are incorporated into a self-sustaining network of interacting entities inspired by methods in artificial immune systems. The network is plastic in both its structure and content, leading to the following properties: it exploits existing knowledge captured in the network to rapidly produce solutions; it can adapt to new problems with wide

APA, Harvard, Vancouver, ISO, and other styles

24

Hansson, Othar, and Andrew Mayer. "Probabilistic heuristic estimates." Annals of Mathematics and Artificial Intelligence 2, no. 1-4 (1990): 209–20. http://dx.doi.org/10.1007/bf01531007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Novotná, Jarmila. "PROBLEM SOLVING IN SCHOOL MATHEMATICS BASED ON HEURISTIC STRATEGIES." Journal on Efficiency and Responsibility in Education and Science 7, no. 1 (2014): 1–6. http://dx.doi.org/10.7160/eriesj.2014.070101.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Reutova, I. "Controls heuristic activity of students at studying higher mathematics." Актуальные направления научных исследований XXI века: теория и практика 2, no. 5 (2014): 293–96. http://dx.doi.org/10.12737/6410.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Obradović, Stojan, and Slobodan Ninković. "The Heuristic Function of Mathematics in Physics and Astronomy." Foundations of Science 14, no. 4 (2009): 351–60. http://dx.doi.org/10.1007/s10699-009-9162-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Jones, Mark T., and Paul E. Plassmann. "A Parallel Graph Coloring Heuristic." SIAM Journal on Scientific Computing 14, no. 3 (1993): 654–69. http://dx.doi.org/10.1137/0914041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Belabid, Jabrane, Said Aqil, and Karam Allali. "Solving Permutation Flow Shop Scheduling Problem with Sequence-Independent Setup Time." Journal of Applied Mathematics 2020 (January 22, 2020): 1–11. http://dx.doi.org/10.1155/2020/7132469.

Full text

Abstract:

In this paper, we study the resolution of a permutation flow shop problem with sequence-independent setup time. The objective is to minimize the maximum of job completion time, also called the makespan. In this contribution, we propose three methods of resolution, a mixed-integer linear programming (MILP) model; two heuristics, the first based on Johnson’s rule and the second based on the NEH algorithm; and finally two metaheuristics, the iterative local search algorithm and the iterated greedy algorithm. A set of test problems is simulated numerically to validate the effectiveness of our reso

APA, Harvard, Vancouver, ISO, and other styles

30

Rubel, Laurie H., Maren Hall-Wieckert, and Vivian Y. Lim. "Teaching Mathematics for Spatial Justice: Beyond a Victory Narrative." Harvard Educational Review 86, no. 4 (2016): 556–79. http://dx.doi.org/10.17763/1943-5045-86.4.556.

Full text

Abstract:

In this reflective essay, Laurie H. Rubel, Maren Hall-Wieckert, and Vivian Y. Lim present a design heuristic for teaching mathematics for spatial justice (TMSpJ) based on their development of two curricular modules, one about the state lottery and the other about financial services in a city. Spatial tools, including data visualizations on maps and participatory mapping, were designed for youth to examine spatial injustices in these systems. The authors' findings report reflections about supporting students to “read and write the world with mathematics” (Freire & Macedo, 1987; Gutstein, 20

APA, Harvard, Vancouver, ISO, and other styles

31

Levy, David, Kaarthik Sundar, and Sivakumar Rathinam. "Heuristics for Routing Heterogeneous Unmanned Vehicles with Fuel Constraints." Mathematical Problems in Engineering 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/131450.

Full text

Abstract:

This paper addresses a multiple depot, multiple unmanned vehicle routing problem with fuel constraints. The objective of the problem is to find a tour for each vehicle such that all the specified targets are visited at least once by some vehicle, the tours satisfy the fuel constraints, and the total travel cost of the vehicles is a minimum. We consider a scenario where the vehicles are allowed to refuel by visiting any of the depots or fuel stations. This is a difficult optimization problem that involves partitioning the targets among the vehicles and finding a feasible tour for each vehicle.

APA, Harvard, Vancouver, ISO, and other styles

32

Prabawati, Mega Nur, Tatang Herman, and Turmudi Turmudi. "Pengembangan Lembar Kerja Siswa Berbasis Masalah dengan Strategi Heuristic untuk Meningkatkan Kemampuan Literasi Matematis." Mosharafa: Jurnal Pendidikan Matematika 8, no. 1 (2019): 37–48. http://dx.doi.org/10.31980/mosharafa.v8i1.383.

Full text

Abstract:

AbstrakMemiliki kemampuan literasi matematis yang baik diharapkan dapat membantu siswa memecahkan masalah yang berkaitan dengan matematika. Fokus keterampilan literasi matematika pada siswa adalah kemampuan untuk menganalisis, membenarkan, dan mengkomunikasikan ide secara efektif, merumuskan, memecahkan dan menafsirkan masalah matematika dalam berbagai bentuk dan situasi. Tujuan dari penelitian ini adalah mengembangkan lembar kerja siswa berbasis masalah yang valid dan praktis untuk meningkatkan kemampuan literasi matematis siswa dalam materi sistem persamaan linear dua variabel. Jenis penelit

APA, Harvard, Vancouver, ISO, and other styles

33

Nofrianto, Adri, Witna Susanti, and Mira Amelia Amri. "PENINGKATAN KEMAMPUAN PEMECAHAN MASALAH MATEMATIKA SISWA MELALUI MODEL PEMBELAJARAN LAPS-HEURISTIC DIKELAS X SMAN 2 BATANG ANAI." Jurnal Gantang 1, no. 2 (2017): 39–50. http://dx.doi.org/10.31629/jg.v1i2.52.

Full text

Abstract:

Penelitian ini bertujuan untuk mengetahui peningkatan kemampuan pemecahan masalah matematika siswa melalui model pembelajaran LAPS-Heuristic. Jenis penelitian ini yaitu penelitian deskriptif kualitatif. Subjek dalam penelitian ini dipilih dua siswa dari kelas penelitian yaitu kelas X SMAN 2 Batang Anai. Subjek yang dipilih dalam merupakan siswa yang memiliki kemampuan matematika tinggi. Data dikumpulkan melalui tes pemecahan masalah dan wawancara. Hal ini dilakukan sebelum dan sesudah penerapa model pembelajaran LAPS-Heuristic. Berdasarkan hasil deskripsi dan analisis data, dapat dilihat perke

APA, Harvard, Vancouver, ISO, and other styles

34

Plaisted, David A., and Jiarong Hong. "A heuristic triangulation algorithm." Journal of Algorithms 8, no. 3 (1987): 405–37. http://dx.doi.org/10.1016/0196-6774(87)90020-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Stynes, Martin. "A Jejune Heuristic Mesh Theorem." Computational Methods in Applied Mathematics 3, no. 3 (2003): 488–92. http://dx.doi.org/10.2478/cmam-2003-0031.

Full text

Abstract:

AbstractA singularly perturbed two-point boundary-value problem is considered. Working in the discrete maximum norm, a necessary condition for the convergence (uniformly in the singular perturbation parameter) of general difference schemes on general meshes is proved. This encompasses both a 1976 result of Miller for uniform meshes and more recent results of the same author that deal with piecewise uniform Shishkin meshes.

APA, Harvard, Vancouver, ISO, and other styles

36

Abdellatif, Houssem, and Bodo Heimann. "A novel multiple-heuristic approach for singularity-free motion planning of spatial parallel manipulators." Robotica 26, no. 5 (2008): 679–89. http://dx.doi.org/10.1017/s0263574708004311.

Full text

Abstract:

SUMMARYThe issue of motion planning for closed-loop mechanisms, such as parallel manipulators or robots, is still an open question. This paper proposes a novel approach for motion planning of spatial parallel robots. The framework for the geometric modeling is based on the visibility graph methodology. It is opted for a multiple-heuristics approach, where different influences are integrated in a multiplicative way within the heuristic cost function. Since the issue of singularities is a fundamental one for parallel robots, it is emphasized on the avoidance of such configurations. To include si

APA, Harvard, Vancouver, ISO, and other styles

37

Rahman, Ira Silviana, Nerru Pranuta Murnaka, and Wiwik Wiyanti. "Pengaruh Model Pembelajaran Laps (Logan Avenue Problem Solving)-Heuristik Terhadap Kemampuan Pemecahan Masalah." WACANA AKADEMIKA: Majalah Ilmiah Kependidikan 2, no. 1 (2018): 48. http://dx.doi.org/10.30738/wa.v2i1.2556.

Full text

Abstract:

The background of this research is the mathematics problem solving skill of students that had not been developed optimally. One of the learning models that’s expected to increase problem solving skills is LAPS (Logan Avenue Problem Solving)-Heuristic. The aim of this research is to compare the increase of mathematics problem solving skill between students who were taught by using LAPS-Heuristic model and conventional method. The kind of this research was quasi experimental by using nonequivalent control group design. Sample selection method used was cluster sampling that was obtained from grad

APA, Harvard, Vancouver, ISO, and other styles

38

Romanycia, Marc H. J., and Francis Jeffry Pelletier. "What is a heuristic?" Computational Intelligence 1, no. 1 (1985): 47–58. http://dx.doi.org/10.1111/j.1467-8640.1985.tb00058.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Aine, Sandip, P. P. Chakrabarti, and Rajeev Kumar. "HEURISTIC SEARCH UNDER CONTRACT." Computational Intelligence 26, no. 4 (2010): 386–419. http://dx.doi.org/10.1111/j.1467-8640.2010.00364.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Xu, M. H., William H. K. Lam, H. Shao, and G. F. Luan. "A heuristic algorithm for network equilibration." Applied Mathematics and Computation 174, no. 1 (2006): 430–46. http://dx.doi.org/10.1016/j.amc.2005.04.094.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Pogonowski, Jerzy. "Remarks on the Principle of Permanence of Forms." Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia 11 (February 5, 2020): 127–41. http://dx.doi.org/10.24917/20809751.11.7.

Full text

Abstract:

We discuss the role of a heuristic principle known as the Principle of Permanence of Forms in the development of mathematics, especially in abstract algebra. We try to find some analogies in the development of modern formal logic. Finally, we add a few remarks on the use of the principle in question in mathematical education.

APA, Harvard, Vancouver, ISO, and other styles

42

Sharps, Matthew J., Adam B. Hess, Jana L. Price-Sharps, and Jane Teh. "Heuristic and Algorithmic Processing in English, Mathematics, and Science Education." Journal of Psychology 142, no. 1 (2008): 71–88. http://dx.doi.org/10.3200/jrlp.142.1.71-88.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Kusdinar, Uus, Sukestiyarno Sukestiyarno, Isnarto Isnarto, and Afit Istiandaru. "Krulik and Rudnik Model Heuristic Strategy in Mathematics Problem Solving." International Journal on Emerging Mathematics Education 1, no. 2 (2017): 205. http://dx.doi.org/10.12928/ijeme.v1i2.5708.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Simarmata, Justin Eduardo, and Lailin Hijriani. "IMPROVING STUDENTS’ COMPETENCY ON FINANCIAL MATHEMATICS LEARNING BY APPLYING POLYAS’ MODEL HEURISTIC STRATEGY." Kalamatika: Jurnal Pendidikan Matematika 5, no. 2 (2020): 143–54. http://dx.doi.org/10.22236/kalamatika.vol5no2.2020pp143-154.

Full text

Abstract:

The research aims to depict students’ ability in solving mathematical problems based on Polya’s heuristic. Descriptive qualitative was used as a method in this research. Data were collected by observation, test, and interview. Based on the result of analysis obtained that the students with low level prior knowledge think heuristically in solving the problem solving test. For the students with medium level prior knowledge, the students think algorithmically and couldn’t solve the problem solving test imperfectly. Furthermore, the students with high level prior knowledge think algorithmically in

APA, Harvard, Vancouver, ISO, and other styles

45

Kayé, Bi Kouaï Bertin, Moustapha Diaby, Moussa Koivogui, and Souleymane Oumtanaga. "A Memetic Algorithm for an External Depot Production Routing Problem." Algorithms 14, no. 1 (2021): 27. http://dx.doi.org/10.3390/a14010027.

Full text

Abstract:

This study aims to compare the results of a memetic algorithm with those of the two-phase decomposition heuristic on the external depot production routing problem in a supply chain. We have modified the classical scheme of a genetic algorithm by replacing the mutation operator by three local search algorithms. The first local search consists in exchanging two customers visited the same day. The second consists in trying an exchange between two customers visited at consecutive periods and the third consists in removing a customer from his current tour for a better insertion in any tour of the s

APA, Harvard, Vancouver, ISO, and other styles

46

Drezner, Zvi. "A new heuristic for the quadratic assignment problem." Journal of Applied Mathematics and Decision Sciences 6, no. 3 (2002): 143–53. http://dx.doi.org/10.1155/s1173912602000093.

Full text

Abstract:

We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short compared with other heuristic procedures. The heuristic performed very well on a set of test problems.

APA, Harvard, Vancouver, ISO, and other styles

47

Darby, Charlotte A., Ravi Gaddipati, Michael C. Schatz, and Ben Langmead. "Vargas: heuristic-free alignment for assessing linear and graph read aligners." Bioinformatics 36, no. 12 (2020): 3712–18. http://dx.doi.org/10.1093/bioinformatics/btaa265.

Full text

Abstract:

Abstract Motivation Read alignment is central to many aspects of modern genomics. Most aligners use heuristics to accelerate processing, but these heuristics can fail to find the optimal alignments of reads. Alignment accuracy is typically measured through simulated reads; however, the simulated location may not be the (only) location with the optimal alignment score. Results Vargas implements a heuristic-free algorithm guaranteed to find the highest-scoring alignment for real sequencing reads to a linear or graph genome. With semiglobal and local alignment modes and affine gap and quality-sca

APA, Harvard, Vancouver, ISO, and other styles

48

Shone, Rob, Vincent A. Knight, and Paul R. Harper. "A conservative index heuristic for routing problems with multiple heterogeneous service facilities." Mathematical Methods of Operations Research 92, no. 3 (2020): 511–43. http://dx.doi.org/10.1007/s00186-020-00722-w.

Full text

Abstract:

AbstractWe consider a queueing system with N heterogeneous service facilities, in which admission and routing decisions are made when customers arrive and the objective is to maximize long-run average net rewards. For this type of problem, it is well-known that structural properties of optimal policies are difficult to prove in general and dynamic programming methods are computationally infeasible unless N is small. In the absence of an optimal policy to refer to, the Whittle index heuristic (originating from the literature on multi-armed bandit problems) is one approach which might be used fo

APA, Harvard, Vancouver, ISO, and other styles

49

Bhanu, S. Mary Saira, and N. P. Gopalan. "A Hyper-Heuristic Approach for Efficient Resource Scheduling in Grid." International Journal of Computers Communications & Control 3, no. 3 (2008): 249. http://dx.doi.org/10.15837/ijccc.2008.3.2393.

Full text

Abstract:

Efficient execution of computations in grid can require mapping of tasks to processors whose performance is both irregular and time varying because of dynamic nature. The task of mapping jobs to the available computing nodes or scheduling of the jobs on the grid is a NP complete problem. The NP-hard problem is often solved using heuristics techniques. Heuristic and metaheuristic approaches tend to be knowledge rich, requiring substantial expertise in both the problem domain and appropriate heuristics techniques. To alleviate this problem the concept of Hyperheuristic was introduced. They opera

APA, Harvard, Vancouver, ISO, and other styles

50

Reid, Gregory J. "Finding abstract Lie symmetry algebras of differential equations without integrating determining equations." European Journal of Applied Mathematics 2, no. 4 (1991): 319–40. http://dx.doi.org/10.1017/s0956792500000589.

Full text

Abstract:

There are symbolic programs based on heuristics that sometimes, but not always, explicitly integrate the determining equations for the infinitesimal Lie symmetries admitted by systems of differential equations. We present a heuristic-free algorithm ‘Structure constant’, which can always determine whether the Lie symmetry group of a given system of PDEs is finite- or infinite-dimensional. If the group is finite-dimensional then ‘Structure constant’ can determine the dimension and structure constants of its associated Lie algebra without the heuristics of integration involved in other methods. I

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!