標(biāo)題: Titlebook: Genetic and Evolutionary Computing; Proceedings of the S Jeng-Shyang Pan,Pavel Kr?mer,Václav Sná?el Conference proceedings 2014 Springer In [打印本頁(yè)] 作者: Optician 時(shí)間: 2025-3-21 16:06
書目名稱Genetic and Evolutionary Computing影響因子(影響力)
書目名稱Genetic and Evolutionary Computing影響因子(影響力)學(xué)科排名
書目名稱Genetic and Evolutionary Computing網(wǎng)絡(luò)公開度
書目名稱Genetic and Evolutionary Computing網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Genetic and Evolutionary Computing被引頻次
書目名稱Genetic and Evolutionary Computing被引頻次學(xué)科排名
書目名稱Genetic and Evolutionary Computing年度引用
書目名稱Genetic and Evolutionary Computing年度引用學(xué)科排名
書目名稱Genetic and Evolutionary Computing讀者反饋
書目名稱Genetic and Evolutionary Computing讀者反饋學(xué)科排名
作者: OFF 時(shí)間: 2025-3-21 22:15
PSO-2S Optimization Algorithm for Brain MRI Segmentation,, . fitting a sum of Gaussian probability density functions to the image histogram. This problem can be expressed as a continuous nonlinear optimization problem. The goal of this paper is to show the relevance of using a recently proposed variant of the Particle Swarm Optimization (PSO) algorithm, c作者: 向外才掩飾 時(shí)間: 2025-3-22 04:10 作者: 迫擊炮 時(shí)間: 2025-3-22 07:46
A Swarm Random Walk Algorithm for Global Continuous Optimization,lve these problems approximately, when solving them exactly is impractical. In this class of methods, swarm intelligence (SI) presents metaheuristics that exploit a population of interacting agents able to self–organize, such as ant colony optimization (ACO), particle swarm optimization (PSO), and a作者: echnic 時(shí)間: 2025-3-22 09:01 作者: 燈泡 時(shí)間: 2025-3-22 15:16 作者: 燈泡 時(shí)間: 2025-3-22 18:20
Object Detection Using Scale Invariant Feature Transform,res from images and it is a useful tool for matching between different views of an object. This paper proposes how the SIFT can be used for an object detection problem, especially human detection problem. The Support Vector Machine (SVM) is adopted as the classifier in the proposed scheme. Experimen作者: 導(dǎo)師 時(shí)間: 2025-3-22 21:24
Nearest Feature Line and Extended Nearest Feature Line with Half Face, are proposed for face recognition. Nearest feature line (NFL) classifier and extended nearest feature line (ENFL) classifier both constitute the feature line by a pair of the samples belonging to the same class. Being different from them, NFLhalfface and ENFLhalfface constitute the feature line by 作者: LEVER 時(shí)間: 2025-3-23 03:10
Studying Common Developmental Genomes in Hybrid and Symbiotic Formations, previous work, we studied the common properties of several computational architectures consisting of connected computational elements. Their common property of sparsely connected networks, envisages how universal properties and processes can be included in a developmental mapping through an . appro作者: 不理會(huì) 時(shí)間: 2025-3-23 09:15
Routing and Wavelength Assignment in Optical Networks from Maximum Edge-Disjoint Paths, We propose an algorithm which is based on the maximum number of edge-disjoint paths (MEDP) to solve the RWA problem. The performance of the proposed method has been verified by experiments on several realistic network topologies.作者: Feature 時(shí)間: 2025-3-23 10:32
Robust Self-organized Wireless Sensor Network: A Gene Regulatory Network Bio-Inspired Approach,ned units that have limited energy and low processing capabilities. Some challenging applications aim to spread a large number of nodes randomly in a geographical location to monitor it. Since it is difficult to access frequently and physically these sensors, an independent, failures resistant and d作者: Additive 時(shí)間: 2025-3-23 14:57 作者: 袖章 時(shí)間: 2025-3-23 18:01
Boosting Scheme for Detecting Region Duplication Forgery in Digital Images,ny support of embedded security information. The proposed method consists of a boosting scheme, feature extraction and similarity matching for the detection of duplicated regions. The boosting scheme comprises an estimation of dark channel, histogram equalization and grayscale layering, by which the作者: 辯論 時(shí)間: 2025-3-24 00:12
Robust Watermarking Scheme for Colour Images Using Radius-Weighted Mean Based on Integer Wavelet Trpecifically, by employing the Euclidean distance of the RWM and mean, a watermark (or copyright logo) is effectively embedded into the low-low subband of the IWT domain. Experiments confirm that the marked images generated by the proposed method are robust against manipulations such as JPEG, JPEG200作者: 羊齒 時(shí)間: 2025-3-24 04:35 作者: Regurgitation 時(shí)間: 2025-3-24 07:40
An Embedded 3D Face Recognition System Using a Dual Prism and a Camera,ented on an embedded development platform named UBIKIT6612. A dual prism placed in front of the camera is used to simulate human binocular vision. We then used the active appearance models (AAM) to find out the corresponding feature points and calculate the depth of the face by stereo vision. Accord作者: Bravado 時(shí)間: 2025-3-24 13:19
Robust Watermarking for Multiple Images and Users Based on Visual Cryptography,ing, DWT transform, and chaos technique. Secret sharing scheme provides better efficient on protecting copyright with multiple users, specifically in some situation, we are not easy to recover watermark by all participants. In order to verify copyright easier, we use polynomial-based image secret sh作者: 不真 時(shí)間: 2025-3-24 18:40 作者: endocardium 時(shí)間: 2025-3-24 22:26
Object Detection Using Scale Invariant Feature Transform,detection problem, especially human detection problem. The Support Vector Machine (SVM) is adopted as the classifier in the proposed scheme. Experiments on INRIA Perdestrian dataset are performed. Preliminary results show that the proposed SIFT-SVM scheme yields promising performance in terms of detection accuracy.作者: inconceivable 時(shí)間: 2025-3-24 23:49 作者: GROWL 時(shí)間: 2025-3-25 04:13 作者: inquisitive 時(shí)間: 2025-3-25 10:44 作者: Licentious 時(shí)間: 2025-3-25 11:54
Kirsten Rusert,Margit Stein,Mehmet Kart0, color quantization, noise additions, cropping, (edge) sharpening, and so on. In addition, the resultant perceived quality is good and the payload is not bad while our peak signal-to-noise ratio (PSNR) is better than existing techniques.作者: dragon 時(shí)間: 2025-3-25 19:30
https://doi.org/10.1007/978-3-531-94140-0aring scheme to reach a supervised verification. Any two users whose owns capability can recover the watermark with the trust authority. The experimental result shows that this scheme is efficient and robust.作者: LINE 時(shí)間: 2025-3-25 20:29
A New Algorithm for Data Clustering Based on Cuckoo Search Optimization,t algorithms: K-means, particle swarm optimization, gravitational search algorithm, the big bang–big crunch algorithm and the black hole algorithm. The experimental results improve the power of the new method to achieve the best values for three data sets.作者: Clinch 時(shí)間: 2025-3-26 03:15
Nearest Feature Line and Extended Nearest Feature Line with Half Face,left half face and right half face of a prototype face, which reduce the computational complexity. At the same time, the experimental results on AR face database and Yale face database show that they are superior to nearest neighbour (NN), NFL, ENFL, nearest feature mid-point (NFM) and shortest feature line segment (SFLS).作者: Generic-Drug 時(shí)間: 2025-3-26 04:27
Robust Watermarking Scheme for Colour Images Using Radius-Weighted Mean Based on Integer Wavelet Tr0, color quantization, noise additions, cropping, (edge) sharpening, and so on. In addition, the resultant perceived quality is good and the payload is not bad while our peak signal-to-noise ratio (PSNR) is better than existing techniques.作者: 不在灌木叢中 時(shí)間: 2025-3-26 09:24 作者: 運(yùn)動(dòng)性 時(shí)間: 2025-3-26 15:42
Demoskopie: Rolle und Wirkungsweise,ound solutions are preserved for new generations. Our proposed algorithm is implemented and evaluated using a set of well-known applications in our specific-defined system environment. The experimental results show that the proposed algorithm outperforms other algorithms within several parameter settings.作者: 時(shí)代錯(cuò)誤 時(shí)間: 2025-3-26 20:53 作者: 飛來(lái)飛去真休 時(shí)間: 2025-3-26 22:20
https://doi.org/10.1007/978-3-322-95759-7g. The proposed algorithm is based on K-means, PSO and Sampling algorithms. It is evaluated on four datasets and the results are compared to those obtained by the algorithms: K-means, PSO, Sampling+K-means, and PSO+K-means. The results show that the proposed algorithm generates the most compact clusters.作者: nauseate 時(shí)間: 2025-3-27 03:37
Wandlungen des bundesdeutschen Sozialstaats,arity matching can be greatly improved. Experimental results show that the proposed boosting scheme can significantly enhance the computation efficiency and have a good detection rate. Moreover, the propose method is robust to any angles rotation attack.作者: arthroscopy 時(shí)間: 2025-3-27 09:03 作者: 轎車 時(shí)間: 2025-3-27 12:41
Task Scheduling in Grid Computing Environments,ound solutions are preserved for new generations. Our proposed algorithm is implemented and evaluated using a set of well-known applications in our specific-defined system environment. The experimental results show that the proposed algorithm outperforms other algorithms within several parameter settings.作者: 百靈鳥 時(shí)間: 2025-3-27 13:36
A Swarm Random Walk Algorithm for Global Continuous Optimization,ndom Walk (SwarmRW), is based on a random walk of a swarm of potential solutions. SwarmRW is validated on test functions and compared to PSO and ABC. Results show improved performance on most of the test functions.作者: Brain-Imaging 時(shí)間: 2025-3-27 19:54
A Sampling-PSO-K-means Algorithm for Document Clustering,g. The proposed algorithm is based on K-means, PSO and Sampling algorithms. It is evaluated on four datasets and the results are compared to those obtained by the algorithms: K-means, PSO, Sampling+K-means, and PSO+K-means. The results show that the proposed algorithm generates the most compact clusters.作者: instructive 時(shí)間: 2025-3-27 23:36
Boosting Scheme for Detecting Region Duplication Forgery in Digital Images,arity matching can be greatly improved. Experimental results show that the proposed boosting scheme can significantly enhance the computation efficiency and have a good detection rate. Moreover, the propose method is robust to any angles rotation attack.作者: 發(fā)生 時(shí)間: 2025-3-28 05:26 作者: 刺激 時(shí)間: 2025-3-28 07:27 作者: 嘲弄 時(shí)間: 2025-3-28 14:02
https://doi.org/10.1007/978-3-322-83296-2 However, HDR images compared with common LDR images are new encoding format, it needs specific method for processing. In this paper, the tailor-made encryption scheme is proposed to encode LogLuv format HDR images for guaranteeing confidentiality while format-compliance is achieved.作者: annexation 時(shí)間: 2025-3-28 18:12
PSO-2S Optimization Algorithm for Brain MRI Segmentation,monly used in the literature on image segmentation, and test images generated from brain MRI simulations. The experimental results show that PSO-2S produces better results than SPSO-07 and improves significantly the stability of the segmentation method.作者: 修飾語(yǔ) 時(shí)間: 2025-3-28 19:05 作者: 懶惰民族 時(shí)間: 2025-3-28 23:25
2194-5357 onary Computing ICGEC 2013 held in Prague, Czech Republic, A.Genetic and Evolutionary Computing.This volume of Advances in Intelligent Systems and Computing contains accepted papers presented at ICGEC 2013, the 7th International Conference on Genetic and Evolutionary Computing. The conference this y作者: Legion 時(shí)間: 2025-3-29 06:04 作者: pericardium 時(shí)間: 2025-3-29 10:45 作者: affluent 時(shí)間: 2025-3-29 12:52
Conference proceedings 2014 7th International Conference on Genetic and Evolutionary Computing. The conference this year was technically co-sponsored by The Waseda University in Japan, Kaohsiung University of Applied Science in Taiwan, and VSB-Technical University of Ostrava. ICGEC 2013 was held in Prague, Czech Republic. Pra作者: 詞匯記憶方法 時(shí)間: 2025-3-29 17:14 作者: 涂掉 時(shí)間: 2025-3-29 19:55
2194-5357 s an international forum for the researchers and professionals in all areas of genetic and evolutionary computing. The main topics of ICGEC 2013 included Intelligent Computing, Evolutionary Computing, Genetic C978-3-319-01795-2978-3-319-01796-9Series ISSN 2194-5357 Series E-ISSN 2194-5365 作者: 特別容易碎 時(shí)間: 2025-3-30 01:05
Forecast Models of Partial Differential Equations Using Polynomial Networks,ly on trained generalized data relations. The character of relative data allows processing a wider range of test interval values than defined by the training set. The characteristics of differential equation solutions also in general facilitate a greater variety of model forms than allow standard so作者: Mediocre 時(shí)間: 2025-3-30 07:00
Studying Common Developmental Genomes in Hybrid and Symbiotic Formations, performance of the partners involved. The results are enlightening gaining a deeper understanding of the capabilities and the limitations of common developmental genomes in these original formations.作者: WAG 時(shí)間: 2025-3-30 08:15
Robust Self-organized Wireless Sensor Network: A Gene Regulatory Network Bio-Inspired Approach,organized, robust and adaptive behavior similar to a biological system. We compare the approach to a classical approach that uses redundancy as a failure resistance strategy, and found a significant increase in lifetime and event detection rates of the entire network.作者: 謙卑 時(shí)間: 2025-3-30 15:57 作者: 助記 時(shí)間: 2025-3-30 16:36 作者: 表狀態(tài) 時(shí)間: 2025-3-30 22:07
Verfassungsgerichte in der Demokratie performance of the partners involved. The results are enlightening gaining a deeper understanding of the capabilities and the limitations of common developmental genomes in these original formations.作者: commonsense 時(shí)間: 2025-3-31 02:59
Die Struktur des Planungssystemsorganized, robust and adaptive behavior similar to a biological system. We compare the approach to a classical approach that uses redundancy as a failure resistance strategy, and found a significant increase in lifetime and event detection rates of the entire network.作者: 來(lái)自于 時(shí)間: 2025-3-31 06:17 作者: 消耗 時(shí)間: 2025-3-31 09:35
https://doi.org/10.1007/978-3-322-92304-2This paper proposed a non-expanding visual sharing scheme. Based on probability method, a friendly visual secret sharing result is approached. Different from traditional friendly visual cryptography method with block expansion characteristic, the proposed method preserve the size of shares. The result is also demonstrates in the paper.作者: 縱火 時(shí)間: 2025-3-31 15:48
Non-expanding Friendly Visual Cryptography,This paper proposed a non-expanding visual sharing scheme. Based on probability method, a friendly visual secret sharing result is approached. Different from traditional friendly visual cryptography method with block expansion characteristic, the proposed method preserve the size of shares. The result is also demonstrates in the paper.作者: employor 時(shí)間: 2025-3-31 20:09
https://doi.org/10.1007/978-3-319-01796-9Computational Intelligence; Evolutionary Computing; Genetic Computing; Intelligent Systems作者: Femine 時(shí)間: 2025-4-1 00:26
Michael Krennerich,Stefan Weyerson. Common neural network techniques of pattern classification or function approximation problems in general are based on whole-pattern similarity relationships of trained and tested data samples. They apply input variables of only absolute interval values, which may cause problems by far various tr作者: 極為憤怒 時(shí)間: 2025-4-1 03:25 作者: oracle 時(shí)間: 2025-4-1 08:23
Demoskopie: Rolle und Wirkungsweise,s. Task scheduling is a critical issue for grid computing, which maps tasks onto a parallel and distributed system for achieving good performance in terms of minimizing the overall execution time. This paper presents a genetic algorithm to solve this problem for improving the existing genetic algori作者: affluent 時(shí)間: 2025-4-1 13:07
A Conceptual Model of Desire-Based Choicelve these problems approximately, when solving them exactly is impractical. In this class of methods, swarm intelligence (SI) presents metaheuristics that exploit a population of interacting agents able to self–organize, such as ant colony optimization (ACO), particle swarm optimization (PSO), and a作者: CESS 時(shí)間: 2025-4-1 14:37
https://doi.org/10.1007/978-3-322-95759-7everal clustering algorithms have been proposed in the literature, and they are used in several areas: security, marketing, documentation, social networks etc. The K-means algorithm is one of the best clustering algorithms. It is very efficient but its performance is very sensitive to the initializa作者: 構(gòu)想 時(shí)間: 2025-4-1 18:56 作者: 殺死 時(shí)間: 2025-4-2 00:33
https://doi.org/10.1007/978-3-663-09579-8res from images and it is a useful tool for matching between different views of an object. This paper proposes how the SIFT can be used for an object detection problem, especially human detection problem. The Support Vector Machine (SVM) is adopted as the classifier in the proposed scheme. Experimen
