175,465 Hits in 3.6 sec

Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm

Karthik Sindhya, Kalyanmoy Deb, Kaisa Miettinen
2011 Natural Computing  
In multiobjective optimization problems, the implementation of local search is a non-trivial task, as determining a goal for local search in presence of multiple conflicting objectives becomes a difficult  ...  Simulation results of the new concurrent-hybrid algorithm on several two to four-objective problems compared to a serial approach, clearly show the importance of local search in aiding a computationally  ...  Acknowledgments The support provided by the Academy of Finland (grant 118319) and the Jenny and Antti Wihuri foundation is highly appreciated.  ... 
doi:10.1007/s11047-011-9250-4 fatcat:54wumbubazfxtoausev2exjsuq

A correction to "Agent searching in a tree and the optimality of iterative deepening"

Pallab Dasgupta, P.P. Chakrabarti, S.C. DeSarkar
1995 Artificial Intelligence  
that are optimal for an agent searching on a line, for an agent searching on m-concurrent rays and for an agent searching on an uniform b-q tree.  ...  In this paper, we establish two results: l We first show that the iterative deepening strategy presented in [2] for an agent searching in m-concurrent rays is actually 1.58 times optimal in the worst case  ...  There is no iterative deepening strategy which is optimal for an agent searching in m-concurrent rays except when m = 2. The best iterative deepening strategy is 1.47 times optimal in the worst case.  ... 
doi:10.1016/0004-3702(95)00089-w fatcat:35ouefdzlfdytay6snwig5hgra


Ibrahim Umar, Otto Johan Anshus, Phuong Hoai Ha
2015 Performance Evaluation Review  
Like other fundamental abstractions for high-performance computing, search trees need to support both high concurrency and data locality.  ...  We present DeltaTree, a practical locality-aware concurrent search tree that integrates both locality-optimization techniques from vEB-based trees, and concurrency-optimization techniques from highly-concurrent  ...  The authors would like to thank the Norwegian Metacenter for Computational Science for giving us access to HPC clusters.  ... 
doi:10.1145/2796314.2745891 fatcat:yfbpco5m3vbezkgxaxyebytode

Model Optimization and Parameter Estimation with Nimrod/O [chapter]

David Abramson, Tom Peachey, Andrew Lewis
2006 Lecture Notes in Computer Science  
Optimization problems where the evaluation step is computationally intensive are becoming increasingly common in both engineering design and model parameter estimation.  ...  We describe a tool, Nimrod/O, that expedites the solution of such problems by performing evaluations concurrently, utilizing a range of platforms from workstations to widely distributed parallel machines  ...  E/b estimates the concurrency for the combined optimizations provided by both batching and concurrent optimizations.  ... 
doi:10.1007/11758501_96 fatcat:27idkel3nvclzbyisflao6h3wu

On the hybridization of SMS-EMOA and local search for continuous multiobjective optimization

Patrick Koch, Oliver Kramer, Günter Rudolph, Nicola Beume
2009 Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09  
The motivation for the hybridization is a notion of combining the best of two worlds: evolutionary black box optimization and local search.  ...  The concurrent approach is based on a parameterized probability function to control the local search.  ...  Hans Kleine Büning of the Knowledge-Based Systems group of the University Paderborn for his useful comments.  ... 
doi:10.1145/1569901.1569985 dblp:conf/gecco/KochKRB09 fatcat:x3mrs3vpnbfxjogbao4ozp4p4y

Concurrent Optimization of Mountain Railway Alignment and Station Locations with a Three-Dimensional Distance Transform Algorithm Incorporating a Perceptual Search Strategy

Hao Pu, Xiaoming Li, Paul Schonfeld, Wei Li, Jian Zhang, Jie Wang, Jianping Hu, Xianbao Peng
2021 IEEE Access  
process. (2) A combined-alignment-station 3D search neighboring mask is developed and employed to search for both the alignment and stations.  ...  It includes the following components: (1) To optimize the location of stations within specified spacing intervals, a novel perceptual search strategy is proposed and incorporated into the basic 3D-DT optimization  ...  in subsequent searches. (2) In order to satisfy the requirements of concurrent optimization, a combined-alignment-station 3D search neighboring mask is developed and employed in the search process along  ... 
doi:10.1109/access.2021.3061587 fatcat:y6fje6t5cjctbhe2ewfzyxenky

A Reliable Web Services Selection Method for Concurrent Requests

Guiming Lu, Yan Hai, Yaoyao Sun
2014 TELKOMNIKA (Telecommunication Computing Electronics and Control)  
This paper aims at solving the Web Services selection for concurrent requests and developing a global optimal selection method for multiple similar service requesters to optimize the system resources.  ...  However, there are multiple service requests for the same functional web service at a time in practice and we cannot choose the best service for users every time because of the service's load.  ...  The algorithm description of Web services selection for concurrency requests In Web service selection optimization problems for concurrent users' demands, the knowledge points corresponds to the sequence  ... 
doi:10.12928/telkomnika.v12i4.786 fatcat:frryiypfjngqtegcdep5ccbdjm

Evolutionary Multiobjective Optimization including Practically Desirable Solutions

Miyako Sagawa, Natsuki Kusuno, Hernán Aguirre, Kiyoshi Tanaka, Masataka Koishi
2017 Advances in Operations Research  
One method searches with one population in the expanded space, whereas the other one uses two populations to search concurrently in the original and expanded space.  ...  The methods expand the objective space by adding fitness functions that favor preferred values for some variables.  ...  Conflicts of Interest The authors declare that there are no conflicts of interest regarding the publication of this paper.  ... 
doi:10.1155/2017/9094514 fatcat:7eo3uixwlzebndz47t7jmmyjfm

Support Concurrent Queries in Multiuser CBIR Systems

Danzhou Liu, Kien A. Hua
2007 2007 IEEE 23rd International Conference on Data Engineering  
Our experimental results, based on the Corel dataset, indicates that the proposed optimization can significantly reduce average response time in a multiuser environment.  ...  In this paper, we propose a generalized query model suitable for expressing queries of different types, and investigate efficient processing techniques for this new framework.  ...  Thus, the original problems addressed in this papers are twofold: 1. a generalized model for various types of CBIR queries, and 2. techniques for efficient support of concurrent queries in a multiuser  ... 
doi:10.1109/icde.2007.369016 dblp:conf/icde/LiuH07 fatcat:ildqug5yz5g65bqbnan43pvi6e

Prediction-Based Power-Performance Adaptation of Multithreaded Scientific Codes

M. Curtis-Maury, F. Blagojevic, C.D. Antonopoulos, D.S. Nikolopoulos
2008 IEEE Transactions on Parallel and Distributed Systems  
The use of prediction reduces the overhead of searching the optimization space while achieving near-optimal performance and power savings.  ...  Concurrency lends itself naturally to allowing a program to trade performance for power savings by regulating the number of active cores, however in several domains users are unwilling to sacrifice performance  ...  ACKNOWLEDGMENT This research is supported by the National Science Foundation (grants CCR-0346867, CCF-0715051, CNS-0521381), the U.S.  ... 
doi:10.1109/tpds.2007.70804 fatcat:ruek3ipnjjcyrk5ch5pxngsd4a

Concurrent stochastic methods for global optimization

Richard H. Byrd, Cornelius L. Dert, Alexander H. G. Rinnooy Kan, Robert B. Schnabel
1990 Mathematical programming  
This paper presents a new parallel algorithm for the global optimization problem.  ...  The global optimization problem, finding the lowest minimizer of a nonlinear function of several variables that has multiple local minimizers, appears well suited to concurrent computation.  ...  Acknowledgement We thank Betty Eskow for her extensive help in continuing computer testing of our parallel algorithms after Cees Deft returned to the Netherlands.  ... 
doi:10.1007/bf01585724 fatcat:6xiprnc2kfghjatbhe2edsfzfq

Tackling the Testing and Verification of Multicore and Concurrent Software as a Search Problem [chapter]

Lionel C. Briand
2012 Lecture Notes in Computer Science  
time for the search to terminate Case Study (Fire and Monitoring, drivers) !"  ...  real data and two different objective functions But optimal solutions were found shortly after the search started, even if the search took a much more time to terminate It took a significant amount of  ...  ., performance) • Three conditions must be met: -At least two threads access same memory location concurrently -At least one thread is writer thread -Thread access to memory location is unsynchronized  ... 
doi:10.1007/978-3-642-31202-1_2 fatcat:dgz7ow7rnjfgdaqeocobuhkdqq

RSCS: A Parallel Simplex Algorithm for the Nimrod/O Optimization Toolset

Andrew Lewis, David Abramson, Tom Peachey
2006 Scientific Programming  
When tested on a range of problems drawn from real-world applications in science and engineering, this reducing set concurrent simplex (RSCS) variant of the Nelder-Mead algorithm compared favourably with  ...  All algorithms were implemented and tested in a general-purpose, grid-enabled optimization toolset.  ...  In this paper a different approach to generating supplementary search directions for concurrent search is proposed.  ... 
doi:10.1155/2006/906394 fatcat:5cgwzffyfvb4ld5dd42urzdvvm

In the Search of Optimal Concurrency [article]

Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi
2016 arXiv   pre-print
In this paper, we treat this question formally by introducing the notion of a \emph{concurrency-optimal} implementation.  ...  We explore the concurrency properties of \emph{search} data structures which can be represented in the form of directed acyclic graphs exporting insert, delete and search operations.  ...  Therefore, our findings motivate the search for concurrency-optimal algorithms.  ... 
arXiv:1603.01384v1 fatcat:i6bru3syt5eobhloeh4a2zllra

Algorithmic improvements for fast concurrent Cuckoo hashing

Xiaozhou Li, David G. Andersen, Michael Kaminsky, Michael J. Freedman
2014 Proceedings of the Ninth European Conference on Computer Systems - EuroSys '14  
Our performance results demonstrate that our new hash table design-based around optimistic cuckoo hashingoutperforms other optimized concurrent hash tables by up to 2.5x for write-heavy workloads, even  ...  Algorithmic optimizations that benefit both HTM and designs for fine-grained locking are needed to achieve high performance.  ...  Dabek and the anonymous reviewers for their insights and helpful comments.  ... 
doi:10.1145/2592798.2592820 dblp:conf/eurosys/LiAKF14 fatcat:adodywrjljgbrdceaygagcu7am
« Previous Showing results 1 — 15 out of 175,465 results