687,082 Hits in 4.6 sec

Techniques for Practical Fixed-Parameter Algorithms

F. Huffner, R. Niedermeier, S. Wernicke
2007 Computer journal  
The fixed-parameter approach is an algorithm design technique for solving combinatorially hard (mostly NP-hard) problems.  ...  Focusing on their application to solving NP-hard problems in practice, we survey three main techniques to develop fixed-parameter algorithms, namely: kernelization (data reduction with provable performance  ...  TECHNIQUES FOR FIXED-PARAMETER ALGORITHMS 9 THEOREM 2.2.  ... 
doi:10.1093/comjnl/bxm040 fatcat:jbffitiefzfexftg3lgl7xnsza

Fixed-Parameter Algorithms for Graph-Modeled Data Clustering [chapter]

Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
2009 Clustering Challenges in Biological Networks  
Our investigations are circumstantiated by three concrete problems from the realm of graph-modeled data clustering for which fixed-parameter algorithms have been implemented and experimentally evaluated  ...  Fixed-parameter algorithms can efficiently find optimal solutions to some NP-hard problems, including several problems that arise in graphmodeled data clustering.  ...  Fixed-Parameter Tractability Basics and Techniques In this section, we introduce the basics of fixed-parameter tractability, in particular exhibiting two techniques that are of major practical importance  ... 
doi:10.1142/9789812771667_0001 fatcat:yv2okjnvjfblhlgit7cnawid4e

Microwave Dielectric Property Based Classification of Malignancies

Tuba Yilmaz
2019 2019 International Conference on Electromagnetics in Advanced Applications (ICEAA)  
In this work, Cole-Cole parameters of rat liver dielectric properties are used for training and testing of an in house Support Vector Machine (SVM) algorithm to enable malignant tissue classification.  ...  The Cole-Cole parameters are fed to the SVM algorithm and k-fold cross validation is used to prevent the algorithm from memorizing the data.  ...  However, for a practical application the probe can not be fixed rather it should be freely moved. Therefore, in a practical setting the error due to the experimental setting is expected to increase.  ... 
doi:10.1109/iceaa.2019.8879293 fatcat:r4zfr436pfbdjjec7mqnz3tejy

The Parameterized Complexity of Constraint Satisfaction and Reasoning [chapter]

Stefan Szeider
2013 Lecture Notes in Computer Science  
Parameterized Complexity is a new and increasingly popular theoretical framework for the rigorous analysis of NP-hard problems and the development of algorithms for their solution.  ...  We outline the basic concepts of Parameterized Complexity and survey some recent parameterized complexity results on problems arising in Constraint Satisfaction and Reasoning.  ...  How to design and improve fixed-parameter algorithms for parameterized problems. For this question there exists a rich toolkit of algorithmic techniques (see, e.g., [46] ). 2.  ... 
doi:10.1007/978-3-642-41524-1_2 fatcat:ee2md36scbckvne73x7qfkw5ra

Recent Advances in Practical Data Reduction [article]

Faisal Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash
2020 arXiv   pre-print
Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems.  ...  This has resulted in an algorithmic toolbox that is by now well-established. However, these theoretical algorithmic ideas have received very little attention from the practical perspective.  ...  The problem is also known to be fixed-parameter tractable when parameterized by |C|, but this particular parameter is expected to be large in practice.  ... 
arXiv:2012.12594v3 fatcat:vpsucno5cvgotovfiihkyyytba

Genetic algorithm approach to fixed-order mixed H/sub 2//H/sub /spl infin/#x221E;/ optimal deconvolution filter designs

Bor-Sen Chen, Jui-Chung Hung
2000 IEEE Transactions on Signal Processing  
For simplicity of implementation and conservation of operation time, the fixed-order mixed 2 optimal deconvolution filter design is interesting for engineers in signal processing from the practical design  ...  However, the conventional mixed 2 optimal design filters are very complicate and are not practical for industrial applications.  ...  mixed is more appealing for practical applications.  ... 
doi:10.1109/78.887037 fatcat:sxzcq56f2bamnpangprrlbt3ne

Localization Algorithm for WSN Application using Genetic Algorithm

Harmeet Kaur, Amanpreet Kaur
2015 International Journal of Engineering Research and  
Application for genetic algorithm has been succesfully built using MATLAB tool.  ...  This paper proposes a localization approach based on genetic algorithm for Wireless Sensor Networks.  ...  Two techniques were applied for calculating the distance; one was using fixed population and other by using random function.  ... 
doi:10.17577/ijertv4is040826 fatcat:ljqnwehttjbgvgebdqmond34ca

Systematic Integration of Parameterized Local Search Into Evolutionary Algorithms

N.K. Bambha, S.S. Bhattacharyya, J. Teich, E. Zitzler
2004 IEEE Transactions on Evolutionary Computation  
We show that the simulated heating technique better utilizes the given optimization time resources than standard hybrid methods that employ fixed parameters, and that the technique is less sensitive to  ...  We introduce a novel approach, called simulated heating, for systematically integrating parameterized local search into evolutionary algorithms (EAs).  ...  This threshold becomes the parameter of the resulting parameterized CDPPO (PCDPPO) algorithm. In summary, PCDPPO is a parameterized adaptation of CDPPO for addressing the schedule looping problem.  ... 
doi:10.1109/tevc.2004.823471 fatcat:gowwdgxpy5b4tnpdatrti4gpge

Fixed-Parameter Algorithms for Graph-Modeled Date Clustering [chapter]

Jiong Guo
2009 Lecture Notes in Computer Science  
We survey some practical techniques for designing fixedparameter algorithms for NP-hard graph-modeled data clustering problems.  ...  After that, we shortly review the use of two further algorithmic techniques, iterative compression and average parameterization, applied to graph-modeled data clustering.  ...  There still remain a lot of challenges concerning the design of fixed-parameter algorithms for graph clustering problems: Until now, experimental studies of fixed-parameter algorithms in the field of graph-modeled  ... 
doi:10.1007/978-3-642-02017-9_7 fatcat:rxuht23lafhslaaj7hg26pyj7q

Electrostatic Micro-actuator Structural Analysis Using Genetic Algorithm

Atal Anil Kumar
2015 International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering  
Algorithm (GA) technique.  ...  A phenomenon in which the actuated electrode comes in direct contact with the fixed electrode due to the electrostatic force is called pull-in instability.  ...  V.CONCLUSION Since the algorithm gives satisfactory output for a cantilever beam, it can be further applied to a fixed-fixed beam and the values can be compared with the existing solutions.  ... 
doi:10.15662/ijareeie.2015.0402037 fatcat:ap53nzbetbgsbdoank4ihtr3vu

A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing [chapter]

Michael R. Fellows
2004 Lecture Notes in Computer Science  
The talk will survey the rich toolkit of FPT algorithm design methodologies that has developed over the last 20 years, including "older" techniques such as well-quasi-ordering, bounded treewidth, color-coding  ...  with a running time of O(f (k)n c ), where c is a fixed constant, k is the parameter, and n is the total input size.  ...  The first of these games is the obvious one of improving the parameter cost function f (k). For example, the first FPT algorithm for Vertex Cover had a running time of 2 k n.  ... 
doi:10.1007/978-3-540-30140-0_1 fatcat:7whgebdxf5abbf4fswhheon52q

Towards Practical Usage of a Domain Adaptation Algorithm in the Early Hours of a Disaster

Hongmin Li, Doina Caragea, Cornelia Caragea
2017 International Conference on Information Systems for Crisis Response and Management  
Among such techniques, domain adaptation approaches present greater potential as compared to supervised algorithms because they don't require labeled data from the current disaster for training.  ...  The results of our study provide useful insights into the practical application of domain adaptation algorithms in real crisis situations.  ...  ACKNOWLEDGMENTS The computing for this project was performed on the Beocat Research Cluster at Kansas State University.  ... 
dblp:conf/iscram/LiCC17 fatcat:lxsavgunifat3ftpomlb5uopsi

Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms [chapter]

Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevin Leyton-Brown
2006 Lecture Notes in Computer Science  
to the default and best fixed parameter settings.  ...  Such empirical hardness models have previously been studied for complete, deterministic search algorithms.  ...  Figure 3 (b) compares our automatic tuning against the best fixed parameter setting for the test set. This setting is often the best that can be hoped for in practice.  ... 
doi:10.1007/11889205_17 fatcat:5q37cck3ijgsjpsctohxuw2i5q

Reconstruction of Outdoor Sculptures from Silhouettes under Approximate Circular Motion of an Uncalibrated Hand-Held Camera

Kwan-Yee Kenneth Wong, Roberto Cipolla
2002 IAPR International Workshop on Machine Vision Applications  
This allows the technique to handle large outdoor sculptures which cannot be rotated on a turntable, making it much more practical and flexible. developed a practical solution to the problem of structure  ...  This paper presents a novel technique for reconstructing an outdoor sculpture from an uncalibrated image sequence acquired around it using a hand-held camera.  ...  The algorithm for circular motion estimation [8] can then be applied to this rectified sequence, with the motion parameters initialized as follows.  ... 
dblp:conf/mva/WongC02 fatcat:3nimeh57zzhszhzsi6tczcl3ry

Ubiquitous Parameterization — Invitation to Fixed-Parameter Algorithms [chapter]

Rolf Niedermeier
2004 Lecture Notes in Computer Science  
The purpose of this article is to stir the reader's interest in this field by providing a gentle introduction to the rewarding field of fixed-parameter algorithms.  ...  Hence, the study of parameterized complexity for computationally hard problems is proving highly fruitful.  ...  I am very grateful to Rod Downey, Michael Fellows, Jens Gramm, Jiong Guo, Falk Hüffner, Klaus-Jörn Lange, Catherine McCartin, Naomi Nishimura, and Prabhakar Ragde for their constructive feedback on a preliminary  ... 
doi:10.1007/978-3-540-28629-5_4 fatcat:vf5gtr3u7jceblnz2ucj77hmky
« Previous Showing results 1 — 15 out of 687,082 results