274,212 Hits in 4.8 sec

General parallel optimization a without metric

Xuedong Shang, Emilie Kaufmann, Michal Valko
2019 International Conference on Algorithmic Learning Theory  
On top of that, we propose a general wrapper, called GPO, that can cope with algorithms that only have simple regret guarantees.  ...  Hierarchical bandits are an approach for global optimization of extremely irregular functions.  ...  Acknowledgements The research presented was supported by European CHIST-ERA project DELTA, French Ministry of Higher Education and Research, Nord-Pas-de-Calais Regional Council, a doctoral grant of Ecole  ... 
dblp:conf/alt/XuedongKV19 fatcat:wmggx2m5pbfrvdbevmnibcpnzq

A Parallel Projection Method for Metric Constrained Optimization [article]

Cameron Ruggles and Nate Veldt and David F. Gleich
2019 arXiv   pre-print
The key to our approach is a new parallel execution schedule that allows us to perform projections at multiple metric constraints simultaneously without any conflicts or locking of variables.  ...  In this paper we present a parallel projection method for metric-constrained optimization which allows us to speed up the convergence rate in practice.  ...  In this work we take a first step in parallelizing projection methods for metric-constrained optimization.  ... 
arXiv:1901.10084v1 fatcat:q3ctxd3vpfdpbob7drkoworobq

Bit-interleaved coded modulation revisited: A mismatched decoding perspective

Alfonso Martinez, Albert Guillen i Fabregas, Giuseppe Caire, Frans Willems
2008 2008 IEEE International Symposium on Information Theory  
The generalized mutual information of the mismatched decoder coincides with the infinite-interleaver BICM capacity, where BICM is modeled as a set of independent parallel binary-input channels whose output  ...  We revisit the information-theoretic analysis of bitinterleaved coded modulation (BICM) by modeling the BICM decoder as a mismatched decoder.  ...  Dotted lines labeled with s = 1 1+ρ correspond to the error exponent of BICM using mismatched metric (5) letting s = 1 1+ρ , i.e., without optimizing over s.  ... 
doi:10.1109/isit.2008.4595408 dblp:conf/isit/MartinezFCW08 fatcat:vbpucjasofenxgzmxgi726br3i


E Sujatha, C Subhas, M N Giri Prasad, N Padmaja
This work adopted Very large-scale Integration Optimization techniques of parallel computation, pipeline process for minimizing computation complexity and computation latency in each soft-input-softoutput  ...  This article presents a simplified turbo decoder using Max-Log-Maximum a posteriori algorithm and its hardware realization.  ...  applied to the proposed Design Resource Utilization & (Utilization %) (post synthesis) without Optimization Utilization (Utilization %) (post synthesis) With optimization and Without resource  ... 
doi:10.34218/ijeet.12.9.2021.011 fatcat:wrm3vlacojh2dakp5jlp6wflhy

ParSetgnostics: Quality Metrics for Parallel Sets

Frederik L. Dennig, Maximilian T. Fischer, Michael Blumenschein, Johannes Fuchs, Daniel A. Keim, Evanthia Dimara
2021 Computer graphics forum (Print)  
The lines represent the values for five metrics for each of the Parallel Sets visualizations, measuring different visual properties.  ...  Figure 1: The layout of dimensions and categories significantly influences the appearance of Parallel Sets.  ...  We perform single-metric and multi-metric optimizations of the Parallel Sets visualizations and conduct a correlation analysis to validate the distinctiveness of our metrics.  ... 
doi:10.1111/cgf.14314 fatcat:w437oi2k3zc7xow2zcijhhixs4

Program optimization space pruning for a multithreaded gpu

Shane Ryoo, Christopher I. Rodrigues, Sam S. Stone, Sara S. Baghsorkhi, Sain-Zee Ueng, John A. Stratton, Wen-mei W. Hwu
2008 Proceedings of the sixth annual IEEE/ACM international symposium on Code generation and optimization - CGO '08  
We demonstrate how these metrics can be used to prune many optimization configurations, down to those that lie on a Pareto-optimal curve.  ...  Even for a seemingly simple application such as matrix multiplication, the optimal configuration can be unexpected.  ...  Sam Stone is supported under a National Science Foundation Graduate Research Fellowship.  ... 
doi:10.1145/1356058.1356084 dblp:conf/cgo/RyooRSBUSH08 fatcat:7inxaxfmtjeojaisdc5awwreku

Adaptive optics based on analog parallel stochastic optimization: analysis and experimental demonstration

Mikhail A. Vorontsov, Gary W. Carhart, Marc Cohen, Gert Cauwenberghs
2000 Optical Society of America. Journal A: Optics, Image Science, and Vision  
It is shown how different requirements for wave-front control can be incorporated, and how information from different wave-front sensor types can be fused, within a generalized gradient descent optimization  ...  Wave-front distortion compensation using direct system performance metric optimization is studied both theoretically and experimentally.  ...  ACKNOWLEDGMENTS The authors thank James Spall for helpful discussions on stochastic optimization methods, Fred Davidson for discussions about the possibilities to apply VLSI-based adaptive optics techniques  ... 
doi:10.1364/josaa.17.001440 pmid:10935872 fatcat:bqcxhxpqyvhsbh34peoavss3qq


Yingxia Shao, Junjie Yao, Bin Cui, Lin Ma
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  
The DCCM applies several heuristic rules to determine the optimal concurrency for the message processor.  ...  We have implemented a prototype of PAGE and conducted extensive studies on a moderate size of cluster.  ...  The DCCM generates the optimal parameters for dual concurrent message processor according to the current metrics.  ... 
doi:10.1145/2505515.2505617 dblp:conf/cikm/ShaoYCM13 fatcat:gb7cjtsnzndxdjj3niybrurrx4

A Parallel Nonrigid Registration Algorithm Based on B-Spline for Medical Images

Xiaogang Du, Jianwu Dang, Yangping Wang, Song Wang, Tao Lei
2016 Computational and Mathematical Methods in Medicine  
To address the issue, a parallel nonrigid registration algorithm based on B-spline is proposed in this paper.  ...  registration algorithm employs the Nonlinear Conjugate Gradient (NCG) optimization method.  ...  similarity metric, and optimization against this similarity metric.  ... 
doi:10.1155/2016/7419307 pmid:28053653 pmcid:PMC5174751 fatcat:sflsy2pyv5ajlbp4cjtiudtrpi

Design of a multimedia processor based on metrics computation

Nader Ben Amor, Yannick Le Moullec, Jean Philippe Diguet, Jean Luc Philippe, Mohamed Abid
2005 Advances in Engineering Software  
To satisfy those challenges, a fast and efficient strategy consists in upgrading a low cost general purpose processor core.  ...  This approach is based on the personalization of a general RISC processor core according the target multimedia application requirements.  ...  In our design space exploration strategy, a first step consisting in a metric-based analysis is performed rapidly without any architectural directive.  ... 
doi:10.1016/j.advengsoft.2005.01.010 fatcat:lo2d45p4mbasbjut5745cifn74

A Framework for Stochastic Optimization of Parameters for Integrative Modeling of Macromolecular Assemblies

Satwik Pasani, Shruthi Viswanath
2021 Life  
To automate this process, we developed a general heuristic for derivative-free, global, stochastic, parallel, multiobjective optimization, termed StOP (Stochastic Optimization of Parameters) and applied  ...  Given an integrative modeling setup, list of parameters to optimize, their domains, metrics that they influence, and the target ranges of these metrics, StOP produces the optimal values of these parameters  ...  Here, we develop a general heuristic for derivative-free, global, stochastic, parallel, multiobjective optimization, termed StOP (Stochastic Optimization of Parameters), that we apply to optimize sampling-related  ... 
doi:10.3390/life11111183 pmid:34833059 pmcid:PMC8618978 fatcat:flpva32yyfd57plhskvtm5dyna

An Effective Parallelism Topology in Ant Colony Optimization algorithm for Medical Image Edge Detection with Critical Path Methodology (PACO-CPM)

Chetan S, H S Seshadri, V Lokesha
2015 International Journal of Recent Contributions from Engineering, Science & IT  
We also propose a methodology for shared memory access by the ants to perform parallel computation and as well implement the optimization factor in detecting the edge.  ...  The proposed scheduler in the defined topological algorithm takes into consideration the metrics generated by As Built Critical Path (ABCP) - A hybrid methodological process.  ...  The product of this research paper would not be possible without all of them.  ... 
doi:10.3991/ijes.v3i4.5139 fatcat:3dvnrairyzcibflgixwlimwqze

Interfacing Computer Aided Parallelization and Performance Analysis [chapter]

Gabriele Jost, Haoqiang Jin, Jesus Labarta, Judit Gimenez
2003 Lecture Notes in Computer Science  
In a prototype implementation we have interfaced the CAPO computer aided parallelization tool with the Paraver performance analysis tool.  ...  When porting sequential applications to parallel computer architectures, the program developer will typically go through several cycles of source code optimization and performance analysis.  ...  A61812D with Computer Sciences Corporation/ AMTI, by the Spanish Ministry of Science and Technology, by the European Union FEDER program under contract TIC2001-0995-C02-01, and by the European Center for Parallelism  ... 
doi:10.1007/3-540-44864-0_19 fatcat:pf4etiubzfcp3ag667sw3wy55y

Energy Study of Monte Carlo and Quasi-Monte Carlo Algorithms for Solving Integral Equations

Todor Gurov, Aneta Karaivanova, Vassil Alexandrov
2016 Procedia Computer Science  
We use SPRNG library and CURAND generator to produce parallel pseudo-random (PPR) sequences for the MC algorithms on CPU-based and GPU -based platforms, respectively.  ...  We compare the energy performance of the algorithms using a GPU-based computer platform and CPU-based computer platform both with and without hyper-threading (HT) technology.  ...  Although the quasi-random sequence generators are not optimized for the GPU-based platform, the QMC algorithms demonstrate better energy efficiency.  ... 
doi:10.1016/j.procs.2016.05.492 fatcat:kog2ehcu5jawdjelncvf3ll6je

Parallel Strategies for Direct Multisearch [article]

S. Tavares, C. P. Brás, A. L. Custódio, V. Duarte, P. Medeiros
2021 arXiv   pre-print
The final parallelized version not only considerably decreases the computational time required for solving a Multiobjective Optimization problem, but also increases the quality of the computed approximation  ...  Direct Multisearch (DMS) is a Derivative-free Optimization class of algorithms suited for computing approximations to the complete Pareto front of a given Multiobjective Optimization problem.  ...  For completeness, we provide a short description of each one of these metrics. A recent revision of Multiobjective Optimization metrics can be found in [3] .  ... 
arXiv:2105.03000v1 fatcat:yvcmby3wtbglhes7vkw6d3le6u
« Previous Showing results 1 — 15 out of 274,212 results