Filters








135,364 Hits in 9.2 sec

A Local Search Algorithm for the Influence Maximization Problem

Enqiang Zhu, Lidong Yang, Yuguang Xu
2021 Frontiers in Physics  
The first one is an approach to constructing an initial solution based on a dominating set, while the second is a degree based greedy strategy in the local search phase.  ...  This problem is known as the Influence Maximization Problem (IMP). Due to its NP-hard nature, designing a "good" algorithm for the IMP is a very challengeable work.  ...  Based on evolutionary methods, [37] introduced a simple genetic algorithm for the IMP.  ... 
doi:10.3389/fphy.2021.768093 doaj:5264f0d82f9343109a71ef27fb4abc8a fatcat:sqhczp47kjduro36w2rnmai244

Coordinate-wise Power Method

Qi Lei, Kai Zhong, Inderjit S. Dhillon
2016 Neural Information Processing Systems  
Inspired by the "greedy" nature of our method, we further propose a greedy coordinate descent algorithm applied on a non-convex objective function specialized for symmetric matrices.  ...  and k  n is the size of the active set.  ...  Acknowledgements This research was supported by NSF grants CCF-1320746, IIS-1546452 and CCF-1564000.  ... 
dblp:conf/nips/LeiZD16 fatcat:v4ptsjg2mfdlbjn6tppjphi2zy

A Deep Learning Model to Recognize and Quantitatively Analyze Cold Seep Substrates and the Dominant Associated Species

Haining Wang, Xiaoxue Fu, Chengqian Zhao, Zhendong Luan, Chaolun Li
2021 Frontiers in Marine Science  
Considering the dense distribution of the dominant associated species and small objects caused by overlap in cold seeps, the feature pyramid network (FPN) embed into the faster region-convolutional neural  ...  This paper develops a deep learning model for the fast and accurate recognition and classification of substrates and the dominant associated species in cold seeps.  ...  METHODS article A Deep Learning Model to Recognize and Quantitatively Analyze Cold Seep Substrates and the Dominant Associated Species 1 Key Laboratory of Marine Ecology and Environmental Sciences  ... 
doi:10.3389/fmars.2021.775433 fatcat:4t5zhxryaneabblvvpktqugr4u

A fast template matching method for LED chip Localization

Fuqiang Zhong, Songping He, Jiangwei Yi, P. Tandon, M. Guo
2015 MATEC Web of Conferences  
Experiments show that the algorithm is faster than the traditional method we choose to locate the LED chips.  ...  Firstly, image segmentation and blob analyzation are used to predict the positions of potential chips. Then predict the orientations of potential chips based on their dominant orientations.  ...  Reference [12] proposed a new algorithm for object detection.  ... 
doi:10.1051/matecconf/20153404002 fatcat:hmwd275ijjeu5n5l2g6y6jrj54

Reference point based multi-objective optimization through decomposition

Asad Mohammadi, Mohammad Nabi Omidvar, Xiaodong Li
2012 2012 IEEE Congress on Evolutionary Computation  
The use of a decomposition method alleviates the selection pressure problem associated with dominance-based approaches while a reference point allows a more focused search.  ...  The experimental results show that the proposed algorithm is capable of finding solutions close to the reference points specified by a decision maker.  ...  A non-dominated set is a set of solutions where all of its members do not dominate each other. A Pareto-optimal set is a non-dominated set where its members dominate all other possible solutions.  ... 
doi:10.1109/cec.2012.6256486 dblp:conf/cec/MohammadiOL12 fatcat:iu6odnixrzb27jwvm5fypwssxe

Multi-Objective Optimization, different approach to query a database [article]

Matteo Cordioli
2022 arXiv   pre-print
In this survey, two different approaches to query a dataset are analyzed and algorithms for each type are explained.  ...  Specifically, the TA and NRA have been analyzed for the Top-K query and the Basic Block Nested Loops has been examined for the skyline query.  ...  To analyze this category of queries we will take into consideration two operators introduced by Paolo Ciaccia and Davide Martinenghi [3] : ND, characterizing the set of non-F-dominated tuples and PO,  ... 
arXiv:2202.01550v1 fatcat:kyejdy6r75h3bj64swbl7gb7oa

Building Damage-Resilient Dominating Sets in Complex Networks against Random and Targeted Attacks [article]

F. Molnar Jr., N. Derzsy, B. K. Szymanski, G. Korniss
2014 arXiv   pre-print
We develop two new methods for finding flexible dominating sets, allowing either adjustable overall resilience, or dominating set size, while maximizing the dominated fraction of the remaining network  ...  We find that cost-efficiency of dominating sets optimized for small size alone comes at a price of being vulnerable to damage; domination in the remaining network can be severely disrupted, even if a small  ...  Acknowledgments We thank Tao Jia for valuable discussion. This work was supported in part by grant No.  ... 
arXiv:1409.7831v1 fatcat:ukfzcbav25fsxaniuqr4hnp2ti

ND-Tree-based update: a Fast Algorithm for the Dynamic Non-Dominance Problem [article]

Andrzej Jaszkiewicz, Thibaut Lust
2017 arXiv   pre-print
In this paper we propose a new method called ND-Tree-based update (or shortly ND-Tree) for the dynamic non-dominance problem, i.e. the problem of online update of a Pareto archive composed of mutually  ...  Furthermore, we apply the method to the non-dominated sorting problem showing that it is highly competitive to some recently proposed algorithms dedicated to this problem.  ...  ACKNOWLEDGMENT The research of Andrzej Jaszkiewicz was funded by the the Polish National Science Center, grant no. UMO-2013/11/B/ST6/01075.  ... 
arXiv:1603.04798v2 fatcat:yq5vtpmpo5dw5e76smrurlnw54

ND-Tree-based update: a Fast Algorithm for the Dynamic Non-Dominance Problem

Andrzej Jaszkiewicz, Thibaut Lust
2018 IEEE Transactions on Evolutionary Computation  
In this paper we propose a new method called ND-Tree-based update (or shortly ND-Tree) for the dynamic nondominance problem, i.e. the problem of online update of a Pareto archive composed of mutually non-dominated  ...  Furthermore, we apply the method to the non-dominated sorting problem showing that it is highly competitive to some recently proposed algorithms dedicated to this problem.  ...  ACKNOWLEDGMENT The research of Andrzej Jaszkiewicz was funded by the the Polish National Science Center, grant no. UMO-2013/11/B/ST6/01075.  ... 
doi:10.1109/tevc.2018.2799684 fatcat:l46pjqqplnbm5crop35vrbq7ca

Finding Top- $k$ Dominance on Incomplete Big Data Using MapReduce Framework

Payam Ezatpoor, Justin Zhan, Jimmy Ming-Tai Wu, Carter Chiu
2018 IEEE Access  
This method has achieved up to two times faster processing time in finding the TKD query result in comparison to previously presented algorithms. iii  ...  Finding top-k dominant values in this type of dataset is a challenging procedure.  ...  Candidate sets can have multiple potential values and depict all of the values in a bucket which can be a dominant value.  ... 
doi:10.1109/access.2018.2797048 fatcat:7o26rjy5rrau3kwqt43dsbks5u

A Divide-and-Conquer Algorithm for 3-D Capacitance Extraction

W. Shi, F. Yu
2004 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Experimental results show that our algorithm is a magnitude faster than the traditional BEM and the window+shield method, for medium to large structures.  ...  We present a new algorithm to improve the 3D boundary element method (BEM) for capacitance extraction.  ...  Input: SP is the set of conductors at unit potential, and SG is the set of conductors grounded. Output: Charge vector Q for each conductor. Method: Any BEM.  ... 
doi:10.1109/tcad.2004.831595 fatcat:64gusplqubc2ddew4d24lczt44

How Do Machines Learn? Artificial Intelligence as a New Era in Medicine

Oliwia Koteluk, Adrian Wartecki, Sylwia Mazurek, Iga Kołodziejczak, Andrzej Mackiewicz
2021 Journal of Personalized Medicine  
With an increased number of medical data generated every day, there is a strong need for reliable, automated evaluation tools.  ...  With high hopes and expectations, machine learning has the potential to revolutionize many fields of medicine, helping to make faster and more correct decisions and improving current standards of treatment  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/jpm11010032 pmid:33430240 fatcat:ghkitfkujvh7djnma7gtkx5w3i

Test and Validation of the Surrogate-Based, Multi-Objective GOMORS Algorithm against the NSGA-II Algorithm in Structural Shape Optimization

Yannis Werner, Tim van Hout, Vijey Subramani Raja Gopalan, Thomas Vietor
2022 Algorithms  
Different multi-objective optimization algorithms are reviewed and methodically ranked in a comparative study by given criteria.  ...  Recently, an optimization routine was implemented and validated for a Non-dominated Sorting Genetic Algorithm (NSGA-II) implementation.  ...  Furthermore, a set of designs, dominated by the current design, is assigned.  ... 
doi:10.3390/a15020046 fatcat:f734f2bbqzgypfo7ota26fos6e

Parallel and Distributed Optimization of Dynamic Data Structures for Multimedia Embedded Systems [chapter]

José L. Risco-Martín, David Atienza, J. Ignacio Hidalgo, Juan Lanchares
2010 Studies in Computational Intelligence  
A key role in this optimization is played by the Dynamic Data Types (DDTs) that reside in every reallife application.  ...  In this work, we propose a method that uses parallel processing and evolutionary computation to explore DDTs in the design of embedded applications.  ...  We compare the obtained sets of non-dominated solutions by means of the above three criteria.  ... 
doi:10.1007/978-3-642-10675-0_12 fatcat:drjtcctg3jc3rnftrpgujw4fjq

General framework for removal of clock network pessimism

Jindrich Zejda, Paul Frain
2002 Computer-Aided Design (ICCAD), IEEE International Conference on  
The implementation based on the proposed framework has proven its strength in a commercial sign-off static timing analyzer and thus is helping hundreds of designers to achieve faster clock speeds of their  ...  The paper presents a simple yet powerful general theoretical framework and efficient implementation for removal of clock network timing pessimism.  ...  Then γ(R) is reduced to the definition of set δ(r) of dominators of node r: Dominator sets define a new relation in the graph, "being a dominator of" or dominance ∆: .  ... 
doi:10.1145/774572.774666 dblp:conf/iccad/ZejdaF02 fatcat:wwab2q76lvfghbd6gay7qcpkuy
« Previous Showing results 1 — 15 out of 135,364 results