Filters








65 Hits in 4.2 sec

Multiple-resolution clustering for recursive divide and conquer

Steven E. Noel, Harold H. Szu, Harold H. Szu
1997 Wavelet Applications IV  
In recent work, a recursive divide-and-conquer approach was developed for path-minimization problems such as the Traveling Salesman Problem (TSP).  ...  However, nothing in the literature addresses the specific type of multiple-resolution clustering needed for the divide-and-conquer approach. That is the primary goal ofthis paper.  ...  Vijay Raghavan for his helpful input and discussions.  ... 
doi:10.1117/12.271725 fatcat:yvzhnegfgnc4zipspiqcalbi2m

Split Recursive Least-Squares: algorithms, architectures, and applications

An-Yeu Wu, K.J. Ray Liu
1996 IEEE transactions on circuits and systems - 2, Analog and digital signal processing  
We also show that for highly correlated data, the orthogonal preprocessing scheme can be used to improve the performance of the Split RLS.  ...  Thus, both the complexity problem in the conventional RLS and the data constraint in the fast RLS can be :solved.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their comments and suggestions to improve the presentation of this paper.  ... 
doi:10.1109/82.536761 fatcat:fajl4rhp4bd6nb5gy3gxjb34ki

Lazy binary-splitting

Alexandros Tzannes, George C. Caragea, Rajeev Barua, Uzi Vishkin
2010 Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '10  
This threshold limits the parallelism and prevents excessive overheads for finegrain parallelism.  ...  We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing (EBS) implemented in  ...  A work-stealer for do-all loops should automate the second solution (divide-and-conquer) and not hide the simultaneous parallelism creation in do-all loops from the compiler.  ... 
doi:10.1145/1693453.1693479 dblp:conf/ppopp/TzannesCBV10 fatcat:j3x6vvurtrhvzj53253riur3ee

An Analysis of Foraging and Echolocation Behavior of Swarm Intelligence Algorithms in Optimization: ACO, BCO and BA

Tanzila Islam, Md Ezharul Islam, Mohammad Raihan Ruhin
2018 International Journal of Intelligence Science  
Furthermore, the behavioral comparison of these three techniques has been analyzed and tried to point out which technique is better for optimization among them in Swarm Intelligence.  ...  The knowledge of the behavior of animals or insects has a variety of models in Swarm Intelligence. Swarm Intelligence has become a potential technique for evolving many robust optimization problems.  ...  divide and conquers technique. 2) The RACS algorithm is advantageous for larger problems where a convergent path is not easily found in limited time by using solely the Ant Colony algo- 3) It can also  ... 
doi:10.4236/ijis.2018.81001 fatcat:rzhslpctrngwdj3kpor7cmb4xi

National strategy of digital cryptographic currency-digital bitcoin decentralized through the internet

Harold Szu
2018 MOJ Applied Bionics and Biomechanics  
Furthermore, each iPhone takes Python TensorFlow software in a lossless "divide and conquers" MPD codec for the total conglomeration.  ...  Approach If we wish to do loss-less divide and conquer strategy in computing, we must know how to take care of the data in chunks such that the total togetherness coherent property is not lost.  ...  Gabor Award in 1997 "for pioneer implementations of fast simulated annealing search," and the Eduardo R.  ... 
doi:10.15406/mojabb.2018.02.00088 fatcat:yuwtwzjulbgezmmjauflk6w5qa

Safe nondeterminism in a deterministic-by-default parallel language

Robert L. Bocchino, Stephen Heumann, Nima Honarmand, Sarita V. Adve, Vikram S. Adve, Adam Welc, Tatiana Shpeisman
2011 Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11  
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound search, remains an open question  ...  An experimental evaluation shows that our language can achieve good scalability for realistic parallel algorithms, and that the barrier removal techniques provide significant performance gains.  ...  An anonymous reviewer encouraged us to study TSP-R. Dan Grossman and Brad Chamberlain provided helpful suggestions on a draft of this paper and the supporting proofs.  ... 
doi:10.1145/1926385.1926447 dblp:conf/popl/BocchinoHHAAWS11 fatcat:faebby5hgfh2xfjtnifsfdpon4

Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research

Kate A. Smith
1999 INFORMS journal on computing  
This article briefly summarizes the work that has been done and presents the current standing of neural networks for combinatorial optimization by considering each of the major classes of combinatorial  ...  optimization problems.  ...  Gendreau, and Dr. B. Golden for their helpful comments and suggestions.  ... 
doi:10.1287/ijoc.11.1.15 fatcat:jy5jur2pyjhndpi45argti2f54

Multiple-resolution divide and conquer neural networks for large-scale TSP-like energy minimization problems

S. Noel, H. Szu
Proceedings of International Conference on Neural Networks (ICNN'97)  
The divide-and-conquer approach is based on a mathematical principle of orthogonal division errors, which provides the criteria for optimal problem division.  ...  Here we describe a multiple-resolution divide-andconquer ANN approach for large-scale constrained optimization problems like the TSP.  ...  Finally, we gave computational results for a TSP divide and conquer.  ... 
doi:10.1109/icnn.1997.616218 dblp:conf/icnn/NoelS97 fatcat:kdexmpyg3rd6rnwkle4wqgjkqi

On Euclidean vehicle routing with allocation

Jan Remy, Reto Spöhel, Andreas Weißl
2010 Computational geometry  
More formally, the input is a set of points P ⊂ R d and functions α : P → [0, ∞) and β : P → [1, ∞).  ...  The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour.  ...  As we do not know the zoom tree corresponding to the optimal solution in advance, we cannot proceed by a topdown divide and conquer approach along the zoom tree.  ... 
doi:10.1016/j.comgeo.2008.12.009 fatcat:blr5nd2kcreqpnjhgxhcrb64ti

As-Continuous-As-Possible Extrusion Fabrication of Surface Models [article]

Fanchao Zhong and Yonglai Xu and Haisen Zhao and Lin Lu
2022 arXiv   pre-print
We propose a novel computational framework for optimizing the toolpath continuity in fabricating surface models on an extrusion-based 3D printer.  ...  For surface models, the effects of continuity are even more severe, in terms of surface quality and model stability.  ...  To conquer these challenges, we adopt a curved layer scheme for ceramics printing.  ... 
arXiv:2201.02374v3 fatcat:2jzegnj3yfdr3isgrqyja2rir4

Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon [article]

Yoshua Bengio and Andrea Lodi and Antoine Prouvost
2020 arXiv   pre-print
Thus, machine learning looks like a natural candidate to make such decisions in a more principled and optimized way.  ...  We advocate for pushing further the integration of machine learning and combinatorial optimization and detail a methodology to do so.  ...  the entire CERC team for endless discussions on the subject and for reading and commenting a preliminary version  ... 
arXiv:1811.06128v2 fatcat:sslxegsjszfl7dvohv3253fyru

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Yudong Zhang, Shuihua Wang, Genlin Ji
2015 Mathematical Problems in Engineering  
biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel  ...  Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques.  ...  They are proximity principle, quality principle, diverse response principle, stability principle, and adaptability principle. Their meanings are listed in Table 2 .  ... 
doi:10.1155/2015/931256 fatcat:ubc5eywnhzdjllxjaywe4czhnm

Chapter 5. Realistic Computer Models [chapter]

Deepak Ajwani, Henning Meyerhenke
2010 Lecture Notes in Computer Science  
The divide and conquer paradigm in the external memory can be considered as an example of this principle.  ...  Dorrigiv et al. show that for a wide range of divide-and-conquer algorithms optimal speedup can be obtained. Vishkin et al.  ... 
doi:10.1007/978-3-642-14866-8_5 fatcat:j326q2ymeffzfmo36nqst7msmq

From 3D models to 3D prints: an overview of the processing pipeline

Marco Livesu, Stefano Ellero, Jonàs Martínez, Sylvain Lefebvre, Marco Attene
2017 Computer graphics forum (Print)  
Each single step, in particular along the Process Planning pipeline, can now count on dozens of methods that prepare the 3D model for fabrication, while analysing and optimizing geometry and machine instructions  ...  The objectives themselves are listed and discussed, along with possible needs for tradeoffs.  ...  Thanks are due to all the members of the Shapes and Semantics Modeling Group at IMATI-CNR and to the partners in the CAxMan project for helpful discussions.  ... 
doi:10.1111/cgf.13147 fatcat:36lgtttxnjawpdj4mpw5x57li4

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
It is shown that for the success of the variant dom must ful ll a regularity property and that the choice of the normal vectors must meet some demands.Both requirements are ful lled if dom is polyhedral  ...  If we use a decomposition approach in order to solve a minimization problem we often get an objective function in such a w a y that its domain dom 6 = n is not given explicitely to us.  ...  We report on two algorithms dealing with these problems both of which are based on the wellknown and widely used Divide&Conquer principle.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa
« Previous Showing results 1 — 15 out of 65 results