A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
ShiftAddNAS: Hardware-Inspired Search for More Accurate and Efficient Neural Networks
[article]
2022
arXiv
pre-print
Preserved Fulltext
hybrid NNs; and (2) a novel weight sharing strategy that enables effective weight sharing among different operators that follow heterogeneous distributions (e.g., Gaussian for convolutions vs. ...
Specifically, it integrates (1) the first hybrid search space that incorporates both multiplication-based and multiplication-free operators for facilitating the development of both accurate and efficient ...
We develop a new weight sharing strategy for effective search with hybrid search spaces, which only incurs a negligible overhead when searching for hybrid operators with heterogeneous (e.g., Gaussian vs ...
arXiv:2205.08119v1
fatcat:aa6clv7rz5ag3nnxe2xikfuxvq
Parallel Hybrid Metaheuristics
[chapter]
2005
Parallel Metaheuristics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Among the latter class, one can cite genetic algorithms (GA) [63], evolution strategies (ES) [115], genetic programming (GP) [74], ant colony optimization (ACO) [22], scatter search (SS) [55], estimation ...
Examples of the former class are descent local search (LS) [109], greedy heuristics (GH) [81], simulated annealing (SA) [72], or tabu search (TS) [56]. ...
The best of all solutions becomes the initial solution for the next phase. In partial hybrids, the problem to be solved is decomposed into sub-problems, each one having its own search space. ...
doi:10.1002/0471739383.ch15
fatcat:frvcocssmbalbgx6lwnjbj3npu
:{unav)
2012
Journal of Heuristics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Hybrid metaheuristics have received considerable interest these recent years in the field of combinatorial optimization. A wide variety of hybrid approaches have been proposed in the literature. ...
In this paper, a taxonomy of hybrid metaheuristics is presented in an attempt to provide a common terminology and classification mechanisms. ...
In global hybrids, all the algorithms search in the whole research space. The goal is here to explore the space more thoroughly. ...
doi:10.1023/a:1016540724870
fatcat:zrjhda6uqfgm3b23zfa7lcm2bu
Towards hybrid evolutionary algorithms
1999
International Transactions in Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Then, we discuss hybridization and present a general classification of the way hybridization can be conducted in the light of our knowledge of the structure of search spaces. ...
This paper briefly reviews the current knowledge we have on search spaces of combinatorial optimization problems. ...
Such a strategy enables the different cooperating algorithms to explore the search space in their own way, each having its own point of view on the problem (each algorithm has its own landscape). ...
doi:10.1016/s0969-6016(99)00019-2
fatcat:cr525zd6hvgg3gfe55642t5jsi
Towards hybrid evolutionary algorithms
1999
International Transactions in Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Then, we discuss hybridization and present a general classification of the way hybridization can be conducted in the light of our knowledge of the structure of search spaces. ...
This paper briefly reviews the current knowledge we have on search spaces of combinatorial optimization problems. ...
Such a strategy enables the different cooperating algorithms to explore the search space in their own way, each having its own point of view on the problem (each algorithm has its own landscape). ...
doi:10.1111/j.1475-3995.1999.tb00173.x
fatcat:axqcpomtujcx5fd23rsnwqo54m
Research on Parallel Optimization of Chaotic Ant Colony Algorithm
2018
DEStech Transactions on Engineering and Technology Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
swarm algorithm (CAS) can improve the defects of the traditional ant colony algorithm (ACO) is easy to fall into local optimum, but extended the optimal time problem; parallel optimization of OpenMP/MPI hybrid ...
parallel programming of heterogeneous CAS algorithm based on multi core platform, to ensure the effectiveness of the CAS algorithm at the same time, to improve the computational efficiency of CAS algorithm ...
and search the boundary to carry out hybrid parallel programming under OpenMP/MPI model. ...
doi:10.12783/dtetr/icmeit2018/23472
fatcat:534ztgfyqzbwvizm6v3ojvfeve
Querying Heterogeneous Datasets on the Linked Data Web: Challenges, Approaches, and Trends
2012
IEEE Internet Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We thank the reviewers and editors for their careful and valuable feedback. ...
Existing Approaches Three high-level categories of approaches for querying linked data exist: approaches employing strategies inherited from the information retrieval (IR) space in which keyword search ...
Although both types provide hybrid search interfaces that merge keyword search with dataset structure elements, only structure search targets indexing strategies focusing on addressing the expressivity-usability ...
doi:10.1109/mic.2011.141
fatcat:kovzfmfjvfhpdeavhxcb3pueba
Interleaving Constraint Propagation: An Efficient Cooperative Search with Branch and Bound
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
reduce the search space. ...
Then it is very important to be able to manage constraint propagation as efficiently as possible, we present a hybrid solver based on a Branch and Bound algorithm combined with constraint propagation to ...
This instantiation manages dynamically some strategies and components of a hybrid solver based on Branch and Bound (B&B) combined with Constraint Propagation in order to reduce the search space. ...
doi:10.1007/978-3-642-38516-2_5
fatcat:fofyfcpmkjgxxp7k7v7ewklnzy
A Unified View on Hybrid Metaheuristics
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We then consider these key components as a toolbox for building new, effective hybrid metaheuristics. ...
A large number of publications documents the benefits and great success of such hybrids. ...
An overview on hybrids of local search based approaches and constraint programming is given in [37] . Basic concepts include: -CP can be used as preprocessing for reducing the search space. ...
doi:10.1007/11890584_1
fatcat:opiskaru25gqpajnmmdua7b6uu
An analysis of massively distributed evolutionary algorithms
2010
IEEE Congress on Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
As these complex models have many local minima, evolutionary algorithms (EAs) are very useful for quickly finding optimal solutions in these challenging search spaces. ...
In addition to the complex search spaces involved, calculating the objective function can be extremely demanding computationally. Because of this, distributed computation is a necessity. ...
ACKNOWLEDGMENT Special thanks go to the Marvin Clan, David Glogau, and the Dudley Observatory for their generous donations to the MilkyWay@Home project, as well as the thousands of volunteers that made ...
doi:10.1109/cec.2010.5586073
dblp:conf/cec/DesellAMNSV10
fatcat:ubyo4xtsf5edzbi5zbcivsgiem
A Dual Heterogeneous Island Genetic Algorithm for Solving Large Size Flexible Flow Shop Scheduling Problems on Hybrid multi-core CPU and GPU Platforms
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
At the higher level, the efficiency of island GAs is improved by exploring new regions within the search space utilizing different methods. ...
In the meantime, the cellular model keeps the population diversity by decentralization and the pseudo model enhances the search ability by the complementary parent strategy at the lower level. ...
Dual Heterogeneous Island Genetic Algorithm on Hybrid multi-core CPU and GPU Platforms
Dual Heterogeneous Island Strategy The general framework of the proposed dual heterogeneous island strategy is shown ...
arXiv:1903.10722v1
fatcat:zqsnalvhkve4toizbbm5oj5mru
Hybridisation of Evolutionary Algorithms for Solving Multi-Objective Simulation Optimisation Problems
2009
Scientific Journal of Riga Technical University Computer Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Hybridisation of Evolutionary Algorithms for Solving Multi-Objective Simulation Optimisation Problems The paper presents a taxonomic analysis of existing hybrid multi-objective evolutionary algorithms ...
For that, the properties of evolutionary algorithms and the requirements made to solving the problem considered are determined. ...
In general, EAs are able to perform a search in a high dimensional space with different ranges for decision variables. ...
doi:10.2478/v10143-010-0001-2
fatcat:rwfjfvhzxvcphfhzpvqxkrmvli
A Study on the Practicality of Poly-Controlled Partial Evaluation
2007
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The second contribution of this work is the introduction of a technique for pruning the search space of this approach. ...
Although PCPE is an appealing approach, it suffers from an inherent blowup of its search space when implemented as a search-based algorithm. ...
Heterogeneity of PCPE Hybrid Solutions As mentioned before, Algorithm 1 produces a set of candidate solutions. ...
doi:10.1016/j.entcs.2007.01.008
fatcat:k5uu4msxdferpmiskubygg6ot4
Bio-Inspired Workflow Scheduling on HPC Platforms
2021
Tehnički glasnik
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
space for multiple workflows. ...
Hence, there is a need to devise mechanisms to improvise the search strategies of the bio-inspired scheduling algorithms for better scheduling solutions in lesser number of iterations/time. ...
Acknowledgement The work has been carried out at Centre for Development of Advanced Computing (C-DAC), SPPU Campus using PARAM-HPC setup and we would also like to thank KPIT R & D, Pune to help us in handling ...
doi:10.31803/tg-20210204183323
fatcat:dc6md3v53rci7jahtk3j3gy6wq
A Survey of Evolutionary Heuristic for Job Scheduling using Grid Computing
2015
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
There is no best solution for all grid computing system. In grid atmosphere Job and resource scheduling is one of the key research area in grid environment. ...
This paper reviews efficient management techniques for managing resources in Grid computing which crucially depends upon the efficient mapping of the jobs to resources according to the user's requirements ...
Hybrid heuristic approaches Hybrid strategies have been constructed to exploit the meta heuristic techniques. ...
doi:10.5120/21099-3805
fatcat:6qpudehelfa3toqfnr7nq4q2ky
« Previous
Showing results 1 — 15 out of 63,795 results