The heuristic function

Lecture Data structure and Algorithm basic lab: Week 13. This lesson provides students with content about: string pattern matching algorithms; brute force matching; Naive algorithm; Knuth-Morris-Pratt algorithm; Boyer-Moore algorithm; exercises;... Please refer to the detailed content of the lecture!

20p codabach1016 03-05-2024 1 0   Download

Then, we analyze a special case that considers only one uncapacitated supplier and a buyer with price-sensitive demand in a serial supply chain. An efficient heuristic is developed for this case to obtain a near optimal solution in a timely manner. Finally, we provide a series of numerical examples to illustrate our results and analyze the impact of the parameters within a sensitivity analysis.

19p longtimenosee10 26-04-2024 3 1   Download

Ebook "An introduction to Neural network methods for differential equations" introduces a variety of neural network methods for solving differential equations arising in science and engineering. The emphasis is placed on a deep understanding of the neural network techniques, which has been presented in a mostly heuristic and intuitive manner. This approach will enable the reader to understand the working, efficiency and shortcomings of each neural network technique for solving differential equations.

124p dieptieuung 19-07-2023 281 274   Download

Continued part 1, part 2 of ebook "Quantum field theory I: Basics in Mathematics and Physics" provide readers with content about: rigorous finite-dimensional perturbation theory; fermions and the calculus for grassmann variables; infinite-dimensional hilbert spaces; distributions and green’s functions; distributions and physics; heuristic magic formulas of quantum field theory; basic strategies in quantum field theory;...

515p damtuyetha 16-02-2023 7 4   Download

Chapter 4a: Informed search algorithms. The main contents of this chapter include all of the following: Heuristic functions estimate costs of shortest paths, good heuristics can dramatically reduce search cost, greedy best-first search expands lowest h – incomplete and not always optimal, admissible heuristics can be derived from exact solution of relaxed problems.

6p cucngoainhan0 10-05-2022 20 3   Download

Lecture Artificial Intelligence - Chapter 4a: Informed search algorithms. The main contents of this chapter include all of the following: Heuristic functions estimate costs of shortest paths, good heuristics can dramatically reduce search cost, greedy best-first search expands lowest h – incomplete and not always optimal, admissible heuristics can be derived from exact solution of relaxed problems.

36p cucngoainhan0 10-05-2022 11 2   Download

This paper presents a solution to the power balance control strategy for WSN with collaborating heuristic. A distance between the weight factors and obtained nodes interference value is used to establish a useful interference model for enhancing the signal-to-interference-noise ratio (SINR). The utility function of the nodes residual energy and transmission rate is modeled by apply heuristic strategy. The optimal transmission power is obtained after several iterations of the heuristic algorithm.

11p linyanjun_2408 21-04-2022 19 3   Download

The search for optimum design variables is conducted by using a recent heuristic method, namely Grey Wolf Optimizer. During the heuristic search, direct heat conduction problem has to be solved several times. The set of heat transfer parameters that lead to smallest error rate between computed temperature field and reference one is the optimum output of the inverse problem. In order to accelerate the process, the model order reduction technique Proper-Orthogonal-Decomposition (POD) is used.

14p nguaconbaynhay11 07-04-2021 15 3   Download

Prioritizing genes according to their associations with a cancer allows researchers to explore genes in more informed ways. By far, Gene-centric or network-centric gene prioritization methods are predominated. Genes and their protein products carry out cellular processes in the context of functional modules.

12p viconnecticut2711 28-10-2020 20 1   Download

During this paper, a very important effort is formed to propose a brand new technique to get the optimized take a look at ways from UML sequence diagram. A tailored algorithmic rule known as as Firefly algorithmic rule is employed to induce the vital ways. Firefly algorithmic rule is met heuristic and impressed from flashing behavior of fireflies.

7p cleopatrahuynh 01-06-2020 12 1   Download

The paper studies are the search optimization task of multi-extremal objects, which are more complicated than mono-extremal. Paper postulates that to nd extreme suitable values on complex test function the heuristic algorithm is one way.

9p vioishi2711 01-07-2019 4 1   Download

Our approach utilizes a more number of artificial ants than traditional ACO. We increased the dependence of heuristic information when compared to general ACO and also modified the heuristic function.

5p byphasse043256 24-03-2019 19 1   Download

This paper proposed a new neuro-fuzzy model without using rule sets for phishing detection. Specifically, the proposed technique calculates the value of heuristics from membership functions. Then, the weights are generated by a neural network.

7p praishy2 27-02-2019 16 0   Download

This paper presents a meta-heuristic optimization algorithm which is based on the intelligent foraging behavior of honey bee swarm and called artificial bee colony (ABC). This algorithm is applied to find out optimal placement and sizing of Solar Photovoltaics Distributed Generation (PVDG) units under considering multiple objective functions in a distribution system.

5p caplock2711 22-02-2019 28 0   Download

The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs.

8p vinguyentuongdanh 20-12-2018 45 0   Download

Data Structures and Algorithms: Text Processing! presents about Pattern Matching, Strings, Brute-Force Pattern Matching, Boyer-Moore Heuristics, Last-Occurrence Function, The Boyer-Moore Algorithm.

58p maiyeumaiyeu23 07-12-2016 57 3   Download

Artificial Intelligence (AI) is a big field, and this is a big book. We have tried to explore the full breadth of the field, which encompasses logic, probability, and continuous mathematics; perception, reasoning, learning, and action; and everything from microelectronic devices to robotic planetary explorers. The book is also big because we go into some depth. The subtitle of this book is “A Modern Approach.

0p hiepkhach_1006 10-09-2013 114 30   Download

The invertebrate nuclear receptor, ultraspiracle (USP), an ortholog of the vertebrate RXR, is typically modelled as an orphan receptor that functions without a ligand-binding activity. The identification of a ligand that can transcrip-tionally activate USP would provide heuristic leads to the structure of potentially high affinity activating compounds, with which to detect unknown regulatory pathways in which this nuclear receptor participates.

11p tumor12 22-04-2013 29 1   Download

Syntactic knowledge is important for pronoun resolution. Traditionally, the syntactic information for pronoun resolution is represented in terms of features that have to be selected and defined heuristically. In the paper, we propose a kernel-based method that can automatically mine the syntactic information from the parse trees for pronoun resolution. Specifically, we utilize the parse trees directly as a structured feature and apply kernel functions to this feature, as well as other normal features, to learn the resolution classifier.

8p hongvang_1 16-04-2013 41 2   Download

Combining word alignments trained in two translation directions has mostly relied on heuristics that are not directly motivated by intended applications. We propose a novel method that performs combination as an optimization process. Our algorithm explicitly maximizes the effectiveness function with greedy search for phrase table training or synchronized grammar extraction. Experimental results show that the proposed method leads to significantly better translation quality than existing methods. ...

4p hongphan_1 15-04-2013 43 1   Download