Search results for 'algorithm' (try it on Scholar)

859 found
Order:
  1.  27
    Kees van Deemter, Albert Gatt, Ielka van der Sluis & Richard Power (2011). Generation of Referring Expressions: Assessing the Incremental Algorithm. Cognitive Science 36 (5):799-836.
    A substantial amount of recent work in natural language generation has focused on the generation of ‘‘one-shot’’ referring expressions whose only aim is to identify a target referent. Dale and Reiter's Incremental Algorithm (IA) is often thought to be the best algorithm for maximizing the similarity to referring expressions produced by people. We test this hypothesis by eliciting referring expressions from human subjects and computing the similarity between the expressions elicited and the ones generated by algorithms. It turns (...)
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  2.  29
    Emiel Krahmer, Ruud Koolen & Mariët Theune (2012). Is It That Difficult to Find a Good Preference Order for the Incremental Algorithm? Cognitive Science 36 (5):837-841.
    In a recent article published in this journal (van Deemter, Gatt, van der Sluis, & Power, 2012), the authors criticize the Incremental Algorithm (a well-known algorithm for the generation of referring expressions due to Dale & Reiter, 1995, also in this journal) because of its strong reliance on a pre-determined, domain-dependent Preference Order. The authors argue that there are potentially many different Preference Orders that could be considered, while often no evidence is available to determine which is a (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  3.  21
    Robin K. Hill (2016). What an Algorithm Is. Philosophy and Technology 29 (1):35-59.
    The algorithm, a building block of computer science, is defined from an intuitive and pragmatic point of view, through a methodological lens of philosophy rather than that of formal computation. The treatment extracts properties of abstraction, control, structure, finiteness, effective mechanism, and imperativity, and intentional aspects of goal and preconditions. The focus on the algorithm as a robust conceptual object obviates issues of correctness and minimality. Neither the articulation of an algorithm nor the dynamic process constitute the (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  4.  7
    Peter Juslin & Magnus Persson (2002). PROBabilities From EXemplars (PROBEX): A “Lazy” Algorithm for Probabilistic Inference From Generic Knowledge. Cognitive Science 26 (5):563-607.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  5.  5
    Kees van Deemter, Albert Gatt, Ielka van der Sluis & Richard Power (2012). Generation of Referring Expressions: Assessing the Incremental Algorithm. Cognitive Science 36 (5):799-836.
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  6.  6
    Susan Hanekon, Sue Berney, Brenda Morrow, George Ntoumenopoulos, Jennifer Paratz, Shane Patman & Quinette Louw (2011). The Validation of a Clinical Algorithm for the Prevention and Management of Pulmonary Dysfunction in Intubated Adults: A Synthesis of Evidence and Expert Opinion. Journal of Evaluation in Clinical Practice 17 (4):801-810.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  7.  19
    S. Dan Felsenthal & Moshé Machover (1992). Sequential Voting by Veto: Making the Mueller-Moulin Algorithm More Versatile. Theory and Decision 33 (3):223-240.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  8.  5
    Shuzhuo Li, Yinghui Chen, Haifeng Du & Marcus W. Feldman (2009). A Genetic Algorithm with Local Search Strategy for Improved Detection of Community Structure. Complexity 15 (4):NA-NA.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  9.  18
    Peter Spirtes, An Algorithm for Fast Recovery of Sparse Causal Graphs.
    Previous asymptotically correct algorithms for recovering causal structure from sample probabilities have been limited even in sparse graphs to a few variables. We describe an asymptotically correct algorithm whose complexity for fixed graph connectivity increases polynomially in the number of vertices, and may in practice recover sparse graphs with several hundred variables. From..
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  10.  31
    Deemter Kees van, Gatt Albert, Sluis Ielka van der & Power Richard (2012). Assessing the Incremental Algorithm: A Response to Krahmer Et Al. Cognitive Science 36 (5):842-845.
    This response discusses the experiment reported in Krahmer et al.’s Letter to the Editor of Cognitive Science. We observe that their results do not tell us whether the Incremental Algorithm is better or worse than its competitors, and we speculate about implications for reference in complex domains, and for learning from ‘‘normal” (i.e., non-semantically-balanced) corpora.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  11.  1
    William M. Farmer (1988). A Unification Algorithm for Second-Order Monadic Terms. Annals of Pure and Applied Logic 39 (2):131-174.
    This paper presents an algorithm that, given a finite set E of pairs of second-order monadic terms, returns a finite set U of ‘substitution schemata’ such that a substitution unifies E iff it is an instance of some member of U . Moreover, E is unifiable precisely if U is not empty. The algorithm terminates on all inputs, unlike the unification algorithms for second-order monadic terms developed by G. Huet and G. Winterstein. The substitution schemata in U use (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  12. Patrick Grim, Evolution of Communication with a Spatialized Genetic Algorithm.
    We extend previous work by modeling evolution of communication using a spatialized genetic algorithm which recombines strategies purely locally. Here cellular automata are used as a spatialized environment in which individuals gain points by capturing drifting food items and are 'harmed' if they fail to hide from migrating predators. Our individuals are capable of making one of two arbitrary sounds, heard only locally by their immediate neighbors. They can respond to sounds from their neighbors by opening their mouths or (...)
     
    Export citation  
     
    My bibliography   1 citation  
  13.  1
    Niestegge Gerd (forthcoming). Quantum Teleportation and Grover’s Algorithm Without the Wavefunction. Foundations of Physics:1-20.
    In the same way as the quantum no-cloning theorem and quantum key distribution in two preceding papers, entanglement-assisted quantum teleportation and Grover’s search algorithm are generalized by transferring them to an abstract setting, including usual quantum mechanics as a special case. This again shows that a much more general and abstract access to these quantum mechanical features is possible than commonly thought. A non-classical extension of conditional probability and, particularly, a very special type of state-independent conditional probability are used (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  14.  10
    Alejandro López-Rousseau & Timothy Ketelaar (2006). Juliet: If They Do See Thee, They Will Murder Thee. A Satisficing Algorithm for Pragmatic Conditionals. Mind and Society 5 (1):71-77.
    In a recent Mind & Society article, Evans (2005) argues for the social and communicative function of conditional statements. In a related article, we argue for satisficing algorithms for mapping conditional statements onto social domains (Eur J Cogn Psychol 16:807–823,2004). The purpose of the present commentary is to integrate these two arguments by proposing a revised pragmatic cues algorithm for pragmatic conditionals.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  15.  27
    Carsten Lutz, Holger Sturm, Frank Wolter & Michael Zakharyaschev (2002). A Tableau Decision Algorithm for Modalized ALC with Constant Domains. Studia Logica 72 (2):199-232.
    The aim of this paper is to construct a tableau decision algorithm for the modal description logic K ALC with constant domains. More precisely, we present a tableau procedure that is capable of deciding, given an ALC-formula with extra modal operators (which are applied only to concepts and TBox axioms, but not to roles), whether is satisfiable in a model with constant domains and arbitrary accessibility relations. Tableau-based algorithms have been shown to be practical even for logics of rather (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography  
  16.  6
    Elżbieta Hajnicz (1996). Applying Allen's Constraint Propagation Algorithm for Non-Linear Time. Journal of Logic, Language and Information 5 (2):157-175.
    The famous Allen's interval relations constraint propagation algorithm was intended for linear time. Its 13 primitive relations define all the possible mutual locations of two intervals on the time-axis. In this paper an application of the algorithm for non-linear time is suggested. First, a new primitive relation is added. It is called excludes since an occurrence of one event in a certain course of events excludes an occurrence of the other event in this course. Next, new composition rules (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  17.  1
    Pascal Koiran & Natacha Portier (2001). Back-and-Forth Systems for Generic Curves and a Decision Algorithm for the Limit Theory. Annals of Pure and Applied Logic 111 (3):257-275.
    It was recently shown that the theories of generic algebraic curves converge to a limit theory as their degrees go to infinity. In this paper we give quantitative versions of this result and other similar results. In particular, we show that generic curves of degree higher than 22r cannot be distinguished by a first-order formula of quantifier rank r. A decision algorithm for the limit theory then follows easily. We also show that in this theory all formulas are equivalent (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  18.  16
    Georg Marckmann (2001). The Eurotransplant Kidney Allocation Algorithm. Moral Consensus or Pragmatic Compromise. Analyse & Kritik 23 (2):271-279.
    The selection and balancing of values for the Eurotransplant kidney allocation algorithm poses both practical and ethical challenges. The paper argues that any allocation algorithm can only be justified by reference to some substantive conception of a good life that reflects our value preferences regarding the allocation of scarce donor kidneys. It is concluded that the criterion of HLA compatibility maximizes overall rather than individual utility. The paper emphasizes that good pragmatic arguments for maintaining the primacy of HLA (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  19. Itamar Pitowsky, The Number of Elements in a Subset: A Grover-Kronecker Quantum Algorithm.
    In a fundamental paper [Phys. Rev. Lett. 78, 325 (1997)] Grover showed how a quantum computer can …nd a single marked object in a database of size N by using only O(pN ) queries of the oracle that identi…es the object. His result was generalized to the case of …nding one object in a subset of marked elements. We consider the following computational problem: A subset of marked elements is given whose number of elements is either M or K, M (...)
     
    Export citation  
     
    My bibliography  
  20.  22
    Mark A. Bedau, Optimal Formulation of Complex Chemical Systems with a Genetic Algorithm.
    We demonstrate a method for optimizing desired functionality in real complex chemical systems, using a genetic algorithm. The chemical systems studied here are mixtures of amphiphiles, which spontaneously exhibit a complex variety of self-assembled molecular aggregations, and the property optimized is turbidity. We also experimentally resolve the fitness landscape in some hyper-planes through the space of possible amphiphile formulations, in order to assess the practicality of our optimization method. Our method shows clear and significant progress after testing only 1 (...)
    No categories
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  21.  25
    Peter Spirtes, An Anytime Algorithm for Causal Inference.
    The Fast Casual Inference (FCI) algorithm searches for features common to observationally equivalent sets of causal directed acyclic graphs. It is correct in the large sample limit with probability one even if there is a possibility of hidden variables and selection bias. In the worst case, the number of conditional independence tests performed by the algorithm grows exponentially with the number of variables in the data set. This affects both the speed of the algorithm and the accuracy (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  22.  23
    Varol Akman, A Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination.
    An efficient algorithm, HALO, is given to compute As computer aided design (CAD) deals with more com- haloed line drawings of wire frame objects. (Haloed..
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  23.  15
    Peter Spirtes, A Polynomial Time Algorithm for Determining Dag Equivalence in the Presence of Latent Variables and Selection Bias.
    if and only if for every W in V, W is independent of the set of all its non-descendants conditional on the set of its parents. One natural question that arises with respect to DAGs is when two DAGs are “statistically equivalent”. One interesting sense of “statistical equivalence” is “d-separation equivalence” (explained in more detail below.) In the case of DAGs, d-separation equivalence is also corresponds to a variety of other natural senses of statistical equivalence (such as representing the same (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  24.  4
    Lian Li, Huilin Li & Yixun Liu (1993). A Decision Algorithm for Linear Sentences on a PFM. Annals of Pure and Applied Logic 59 (3):273-286.
    By PFM, we mean a finitely generated module over a principal ideal domain; a linear sentence is a sentence that contains no disjunctive and negative symbols. In this paper, we present an algorithm which decides the truth for linear sentences on a given PFM, and we discuss its time complexity. In particular, when the principal ideal domain is the ring of integers or a univariate polynomial ring over the field of rationals, the algorithm is polynomial-time. Finally, we consider (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  25.  4
    Shane Harwood & Richard Scheines, Genetic Algorithm Search Over Causal Models.
    Shane Harwood and Richard Scheines. Genetic Algorithm Search Over Causal Models.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  26.  4
    Ravi Santosh Arvapally & Xiaoqing (2013). Polarisation Assessment in an Intelligent Argumentation System Using Fuzzy Clustering Algorithm for Collaborative Decision Support. Argument and Computation 4 (3):181-208.
    We developed an on-line intelligent argumentation system which facilitates stakeholders in exchanging dialogues. It provides decision support by capturing stakeholders? rationale through arguments. As part of the argumentation process, stakeholders tend to both polarise their opinions and form polarisation groups. The challenging issue of assessing argumentation polarisation had not been addressed in argumentation systems until recently. Arvapally, Liu, and Jiang [(2012), ?Identification of Faction Groups and Leaders in Web-Based Intelligent Argumentation System for Collaborative Decision Support?, in Proceedings of International Conference (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  27.  2
    E. Hirsch (1998). A Fast Deterministic Algorithm For Formulas That Have Many Satisfying Assignments. Logic Journal of the IGPL 6 (1):59-71.
    How can we find any satisfying assignment for a Boolean formula that has many satisfying assignments? There exists an obvious randomized algorithm for solving this problem: one can just pick an assignment at random and check the truth value of the formula for this assignment, this is iterated until a satisfying assignment occurs. Does there exist a polynomial-time deterministic algorithm that solves the same problem? This paper presents such an algorithm and shows that its worst-case running time (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  28.  2
    Rohit Parikh, Laxmi Parida & Vaughan Pratt (2001). Sock Sorting: An Example of a Vague Algorithm. Logic Journal of the IGPL 9 (5):687-692.
    We give an example of a polynomial time algorithm for a particular algorithmic problem involving vagueness and visual indiscriminability, namely sock sorting.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  29.  9
    C. Gaucherel & S. Bérard (2011). Equation or Algorithm: Differences and Choosing Between Them. Acta Biotheoretica 59 (1):67-79.
    The issue of whether formal reasoning or a computing-intensive approach is the most efficient manner to address scientific questions is the subject of some considerable debate and pertains not only to the nature of the phenomena and processes investigated by scientists, but also the nature of the equation and algorithm objects they use. Although algorithms and equations both rely on a common background of mathematical language and logic, they nevertheless possess some critical differences. They do not refer to the (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  30.  2
    Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson & Dorothea Wagner, Algorithm Engineering (Dagstuhl Seminar 13391).
    This report documents the program and the outcomes of Dagstuhl Seminar 13391 "Algorithm Engineering". The algorithm engineering approach consists of a cycle of algorithm design, analysis, implementation, and experimental evaluation, with the aim of bridging the gap between theory and practice in the area of algorithms. This cycle of phases is driven by falsifiable hypotheses validated by experiments. Moreover, real-world instances often have direct impact on this cycle since they often expose modeling and analysis shortcomings. Algorithm (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  31. Agah Arvin & O. Johnson David (2011). A Novel Efficient Algorithm for Locating and Tracking Object Parts in Low Resolution Videos. Journal of Intelligent Systems 20 (1):79-100.
    In this paper, a novel efficient algorithm is presented for locating and tracking object parts in low resolution videos using Lowe's SIFT keypoints with a nearest neighbor object detection approach. Our interest lies in using this information as one step in the process of automatically programming service, household, or personal robots to perform the skills that are being taught in easily obtainable instructional videos. In the reported experiments, the system looked for 14 parts of inanimate and animate objects in (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  32. Marlies Ahlert, Gundolf Gubernatis & Hartmut Kliemt (2001). Kidney Allocation in Eurotransplant. A Systematic Account of the Wujciak-Opelz Algorithm. Analyse & Kritik 23 (2):156-172.
    In the Eurotransplant region transplantable kidneys from cadaveric donors are allocated according to the Wujciak-Opelz algorithm. This paper shows that the algorithm as it stands fulfils certain normative standards of a more formal nature while violating others. In view of these insights, it is explored how the algorithm could perhaps be improved. Even if issues of substantial rather than formal adequacy need to be addressed separately, analyses as presented in this paper can prepare the ground for a (...)
    No categories
     
    Export citation  
     
    My bibliography  
  33. A. Awadallah Mohammed, Al-Betar Mohammed Azmi, Khader Ahamad Tajudin & Bolaji Asaju La’aro (2015). A Hybrid Nature-Inspired Artificial Bee Colony Algorithm for Uncapacitated Examination Timetabling Problems. Journal of Intelligent Systems 24 (1):37-54.
    This article presents a Hybrid Artificial Bee Colony for uncapacitated examination timetabling. The ABC algorithm is a recent metaheuristic population-based algorithm that belongs to the Swarm Intelligence technique. Examination timetabling is a hard combinatorial optimization problem of assigning examinations to timeslots based on the given hard and soft constraints. The proposed hybridization comes in two phases: the first phase hybridized a simple local search technique as a local refinement process within the employed bee operator of the original ABC, (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  34. Cai Yanguang, Xu Jianmin & Zhang Minjie (2012). Heuristic Ant Algorithm for Road Network Traffic Coordination Control. Journal of Intelligent Systems 21 (4):331-347.
    . The defects in macro traffic model research are pointed out firstly. In order to remedy these defects, traffic movements at the grid intersection were analyzed, and with the basic framework of the traffic transmission model, the new macro traffic model used in the paper for control simulation and evaluation has been proposed. Secondly, the bi-level optimization control model is proposed, using minimal delay and maximal throughput as its upper objectives, and optimal traffic coordination on both sides as the lower (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  35. Salim Chikhi, Abdesslem Layeb & Widad Kartous (2014). A New Quantum Cuckoo Search Algorithm for Multiple Sequence Alignment. Journal of Intelligent Systems 23 (3):261-275.
    Multiple sequence alignment is one of the major problems that can be encountered in the bioinformatics field. MSA consists in aligning a set of biological sequences to extract the similarities between them. Unfortunately, this problem has been shown to be NP-hard. In this article, a new algorithm was proposed to deal with this problem; it is based on a quantum-inspired cuckoo search algorithm. The other feature of the proposed approach is the use of a randomized progressive alignment method (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  36. Robert Constable & Wojciech Moczydłowski (2009). Extracting the Resolution Algorithm From a Completeness Proof for the Propositional Calculus. Annals of Pure and Applied Logic 161 (3):337-348.
    We prove constructively that for any propositional formula in Conjunctive Normal Form, we can either find a satisfying assignment of true and false to its variables, or a refutation of showing that it is unsatisfiable. This refutation is a resolution proof of ¬. From the formalization of our proof in Coq, we extract Robinson’s famous resolution algorithm as a Haskell program correct by construction. The account is an example of the genre of highly readable formalized mathematics.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  37. Duan Huixian, Xu Xianglong, Tan Yunlan, Li Guangyao & Li Chao (2012). A New Image Enhancement Algorithm Via Wavelet Homomorphic Filtering Transform. Journal of Intelligent Systems 21 (4):349-362.
    . A new spatial-frequency image enhancement algorithm via wavelet homomorphic filtering transform is proposed to enhance the contrast of an image. The wavelet analysis coefficients are processed using a high-pass filter to amplify the high spatial frequencies and attenuate the low spatial frequencies. So the object features can be emphasized while the undesired contributions within the image due to light source nonuniformity can be reduced. Experimental results show that this new algorithm can gain better performance in enhancing the (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  38. Xu Haitao, Lin Fei, Chen Tao & Zheng Ning (2015). A Hybrid Heuristic Algorithm for the Intelligent Transportation Scheduling Problem of the BRT System. Journal of Intelligent Systems 24 (4):437-448.
    This work proposes a hybrid heuristic algorithm to solve the bus rapid transit intelligent scheduling problem, which is a combination of the genetic algorithm, simulated annealing algorithm, and fitness scaling method. The simulated annealing algorithm can increase the local search ability of the genetic algorithm, so as to accelerate its convergence speed. Fitness scaling can reduce the differences between individuals in the early stage of the algorithm, to prevent the genetic algorithm from falling (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  39. R. Kumaraswamy, V. Kamakshi Prasad, Nilabh Kumar Pathak & M. S. Rudramurthy (2014). Speaker Identification Using Empirical Mode Decomposition-Based Voice Activity Detection Algorithm Under Realistic Conditions. Journal of Intelligent Systems 23 (4):405-421.
    Speaker recognition under mismatched conditions is a challenging task. Speech signal is nonlinear and nonstationary, and therefore, difficult to analyze under realistic conditions. Also, in real conditions, the nature of the noise present in speech data is not known a priori. In such cases, the performance of speaker identification or speaker verification degrades considerably under realistic conditions. Any SR system uses a voice activity detector as the front-end subsystem of the whole system. The performance of most VADs deteriorates at the (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  40. R. Kumaraswamy, V. Kamakshi Prasad & M. S. Rudramurthy (2014). Speaker Verification Under Degraded Conditions Using Empirical Mode Decomposition Based Voice Activity Detection Algorithm. Journal of Intelligent Systems 23 (4):359-378.
    The performance of most of the state-of-the-art speaker recognition systems deteriorates under degraded conditions, owing to mismatch between the training and testing sessions. This study focuses on the front end of the speaker verification system to reduce the mismatch between training and testing. An adaptive voice activity detection algorithm using zero-frequency filter assisted peaking resonator was integrated into the front end of the SV system. The performance of this proposed SV system was studied under degraded conditions with 50 selected (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  41. Li Leiting, Zhao Jiali, Liu Aijun, Yang Yu & Bao Beifang (2014). Task Allocation Optimization in Collaborative Customized Product Development Based on Adaptive Genetic Algorithm. Journal of Intelligent Systems 23 (1):1-19.
    Due to the currently insufficient consideration of task fitness and task coordination for task allocation in collaborative customized product development, this research was conducted based on the analysis of collaborative customized product development process and task allocation strategy. The definitions and calculation formulas of task fitness and task coordination efficiency were derived, and a multiobjective optimization model of product customization task allocation was constructed. A solution based on adaptive genetic algorithm was proposed, and the feasibility and effectiveness of the (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  42.  8
    Matthias Müller-Hannemann & Stefan Schirra (eds.) (2010). Algorithm Engineering: Bridging the Gap Between Algorithm Theory and Practice. Springer.
    Driven by concrete applications, Algorithm Engineering complements theory by the benefits of experimentation and puts equal emphasis on all aspects arising during a cyclic solution process ranging from realistic modeling, design, analysis, ...
    Direct download  
     
    Export citation  
     
    My bibliography  
  43. Saroj Ratnoo & Jyoti Ahuja (2015). Optimizing Feature Subset and Parameters for Support Vector Machine Using Multiobjective Genetic Algorithm. Journal of Intelligent Systems 24 (2):145-160.
    The well-known classifier support vector machine has many parameters associated with its various kernel functions. The radial basis function kernel, being the most preferred kernel, has two parameters to be optimized. The problem of optimizing these parameter values is called model selection in the literature, and its results strongly influence the performance of the classifier. Another factor that affects the classification performance of a classifier is the feature subset. Both these factors are interdependent and must be dealt with simultaneously. Following (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  44. Suhas Santebennur Ranganatha, Sanjay Kumar, Shobhit Khandelwal, Rahul Khandelwal & Praveen Ranjan Srivastava (2012). Automated Test Data Generation Using Cuckoo Search and Tabu Search Algorithm. Journal of Intelligent Systems 21 (2):195-224.
    . Software testing is a very important phase in the development of software. Testing includes the generation of test cases which, if done manually, is time consuming. To automate this process and generate optimal test cases, several meta-heuristic techniques have been developed. These approaches include genetic algorithm, cuckoo search, tabu search, intelligent water drop, etc. This paper presents an effective approach for test data generation using the cuckoo search and tabu search algorithms. It combines the cuckoo algorithm's strength (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  45. James M. Stiles, Arvin Agah & Brien Smith-Martinez (2013). A Genetic Algorithm for Generating Radar Transmit Codes to Minimize the Target Profile Estimation Error. Journal of Intelligent Systems 22 (4):503-525.
    This article presents the design and development of a genetic algorithm to generate long-range transmit codes with low autocorrelation side lobes for radar to minimize target profile estimation error. The GA described in this work has a parallel processing design and has been used to generate codes with multiple constellations for various code lengths with low estimated error of a radar target profile.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  46. Zhuang Zhi Yan & Wei Jia Lu (2015). Improved FCM Algorithm Based on K-Means and Granular Computing. Journal of Intelligent Systems 24 (2):215-222.
    The fuzzy clustering algorithm has been widely used in the research area and production and life. However, the conventional fuzzy algorithms have a disadvantage of high computational complexity. This article proposes an improved fuzzy C-means algorithm based on K-means and principle of granularity. This algorithm is aiming at solving the problems of optimal number of clusters and sensitivity to the data initialization in the conventional FCM methods. The initialization stage of the K-medoid cluster, which is different from (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  47. Yu Yang, Qiong He, Xing Rong Fan & Qiu Xie (2015). Location Model and Algorithm of Construction Waste Recycling Centers for Service Reliability. Journal of Intelligent Systems 24 (2):287-297.
    Presently, most studies focus on the minimization of the costs and negative social effects of the location of construction waste recycling centers; however, the influence of the location on future operation is usually ignored. Aiming at solving these problems, a location model for the maximization of service reliability was devised. Service reliability includes the recycling reliability of the construction waste and the delivery reliability of the recycled product. Through maximizing service reliability, the location deviation as a result of arrival delay (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  48. Yongquan Zhou & Zhonghua Tang (2015). A Glowworm Swarm Optimization Algorithm for Uninhabited Combat Air Vehicle Path Planning. Journal of Intelligent Systems 24 (1):69-83.
    Uninhabited combat air vehicle path planning is a complicated, high-dimension optimization problem. To solve this problem, we present in this article an improved glowworm swarm optimization algorithm based on the particle swarm optimization algorithm, which we call the PGSO algorithm. In PGSO, the mechanism of a glowworm individual was modified via the individual generation mechanism of PSO. Meanwhile, to improve the presented algorithm’s convergence rate and computational accuracy, we reference the idea of parallel hybrid mutation and (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  49. Noradin Ghadimi (2015). A New Hybrid Algorithm Based on Optimal Fuzzy Controller in Multimachine Power System. Complexity 21 (1):78-93.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  50. Mehrdad Tarafdar Hagh & Noradin Ghadimi (2015). Multisignal Histogram-Based Islanding Detection Using Neuro-Fuzzy Algorithm. Complexity 21 (1):195-205.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   10 citations  
1 — 50 / 859