[PDF] Top 20 Recursive and iterative algorithms for N-ary search problems
Has 10000 "Recursive and iterative algorithms for N-ary search problems" found on our website. Below are the top 20 most common "Recursive and iterative algorithms for N-ary search problems".
Recursive and iterative algorithms for N-ary search problems
... node, and the message identification, which is used to activate the respective processing ...node, and the right sub-tree contains only messages that are more ...constructed and used for ... See full document
10
Intelligent systems engineering with reconfigurable computing
... memory and reconfigurable user-programmable logic represent a promising technology which is well-suited for applications such as digital signal and image processing, cryptography and ... See full document
10
Hybrid algorithms for solving routing problems
... approaches for the VRP. GA are a family of adaptive heuristic search methods based on population genetics ...an iterative pro- cess until some convergence criteria are met, ...As for mutation, ... See full document
172
Comparing metaheuristic algorithms for error detection in Java programs
... The search for errors in a model can be transformed in the search for one ob- jective node (a program state that violates a given condition) in a graph, the transition graph of the program, ... See full document
15
New Advances on Modelling Control Processes applied to the Detection of Train Operations
... Initial phase implies an intensive search, using genetic algorithms, to optimize the fuzzy rules bases for each one of the control component (central and elemental modules) according [r] ... See full document
6
Access and Branch Management on Distributed Personal Digital Libraries -Edición Única
... For all of these problems we propose a solution based on a RESTful peer to peer model of collaboration and interoperability that allows users to search, branch and contribute to public [r] ... See full document
65
A self-adaptive recombination method in evolutionary algorithms for solving epistatic problems
... cut and splice material, is ...of n-point crossover distributions, it considers only two forms of crossover, two-point and ...locus for crossover ... See full document
10
Applications of Biased Randomization and Simheuristic Algorithms to Arc Routing and Facility Location Problems
... differentiable and it has continuous derivatives of all ...optimization problems (NSPs) are similar to NCVOPs in the sense that they are much more difficult to solve than traditional smooth and ... See full document
133
Genetic algorithms for topical web search: A study of different mutation rates
... queries and submitting them to a search ...the search space, where candidate solutions are queries and each term corresponds to a different dimension, (2) the existence of acceptable ... See full document
11
Study and development of reinforcement learning multiagent collaborative algorithms for solving families of problems
... intelligence algorithms enable autonomous agents to perform sophisticated tasks with great ...planning and optimal control of an environment through interaction with it and without prior ...used, ... See full document
53
An evaluation of best compromise search in graphs
... [7], and then identifying the optimal solution among ...the search to compare the current subpaths and keep only the optimal ...[2]. For any vector cost y ∈ R q , it can indeed be easily shown ... See full document
10
Intelligent algorithms for reducing query propagation in thematic P2P search
... proposed algorithms in a simulation environment made it possible to obtain different statistics about their behavior such as response time and network ...the algorithms with better behavior are those ... See full document
9
Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem
... 6XSSRVLQJ D -663 ZLWK MREV DQG PDFKLQHV D SRVVLEOH FKURPRVRPH XQGHU RSHUDWLRQ EDVHG UHSUHVHQWDWLRQ PLJKW EH [ > @ 1RZ VRPH HYDOXDWLRQ IXQFWLRQ WKDW SURYLGHV IHHGEDFN IRU WKH[r] ... See full document
11
Access and Branch Management on Distributed Personal Digital Libraries Edición Única
... For all of these problems we propose a solution based on a RESTful peer to peer model of collaboration and interoperability that allows users to search, branch and contribute to public c[r] ... See full document
63
Cheminformatic models to predict binding affinities to human serum albumin
... GFA search and selection was performed in two ...to search as much as possible the equation ...quadratic, and quadratic spline. The mutation probabilities for evolution were set as fol- ... See full document
9
Current trends in designing metaheuristic algorithms: applications to machine learning
... cost and an idea difference strategy (IDS) to generate the new individuals, improving the results of classic ...minimization and collision avoidance ...local and global search ability of the ... See full document
234
Algorithms for learning fuzzy linguistic rule-based systems in high-dimensional problems
... modules for building up large assemblies such as virus particles or muscle fibers, or they can provide specific catalytic or binding sites, as found in enzymes or proteins that carry oxygen or regulate the ... See full document
209
OPPOSITE LEARNING STRATEGIES FOR IMPROVING THE SEARCH PROCESS OF ANT-BASED ALGORITHMS
... (OBL) and Opposition-Inspired Learning ...the search process with the higher quality ...metaheuristics for solving continuous problems and with the objective of initializing the target ... See full document
161
The adjoining cell mapping and its recursive unraveling, Part II: Application to selected problems
... When detecting limit cycles, a simple cell mapping may replace it by more than one group of periodic cells and the number of groups and the location of periodic cells are highly depende[r] ... See full document
28
Recursive lower and dual upper bounds for Bermudan-style options
... simulation and least-squares methods using lower and dual upper bounds, the latter are hardly ...optimize recursive upper bounds, which are more tractable than the original/nonrecursive ones, ... See full document
11
Related subjects