A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Filters
Maintaining Soft Arc Consistencies in BnB-ADOPT + during Search
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
With extra copies of variable domains and cost functions, the consistency enforcement in different subproblems can be performed asynchronously. ...
upper agents which could not lead to an optimal solution, (iii) transferring deletions from subproblems to further subproblems to avoid redundant messages, and (iv) asynchronous methods to ensure identical ...
doi:10.1007/978-3-642-40627-0_30
fatcat:iew2362z6fa4jbv6milpmdakq4
Distributed Partitioned Big-Data Optimization via Asynchronous Dual Decomposition
2017
IEEE Transactions on Control of Network Systems
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.
In this paper we consider a novel partitioned framework for distributed optimization in peer-to-peer networks. ...
In several important applications the agents of a network have to solve an optimization problem with two key features: (i) the dimension of the decision variable depends on the network size, and (ii) cost ...
Fig. 6 . 6 Evolution of the cost error for the asynchronous distributed algorithm. ...
doi:10.1109/tcns.2017.2774010
fatcat:bob74zqpobaitevmrxd5bou43u
Byzantine Fault Tolerance in Distributed Machine Learning : a Survey
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
Byzantine Fault Tolerance (BFT) is among the most challenging problems in Distributed Machine Learning (DML). ...
We offer an illustrative description of techniques used in BFT in DML, with a proposed classification of BFTs approaches in the context of their basic techniques. ...
BFT in DML
With aggregation rules as geometric median With BFT consensus With gradient redundancy and coding theory 1. ...
arXiv:2205.02572v1
fatcat:h2hkcgz3w5cvrnro6whl2rpvby
Distributed Partitioned Big-Data Optimization via Asynchronous Dual Decomposition
[article]
2018
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 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we consider a novel partitioned framework for distributed optimization in peer-to-peer networks. ...
In several important applications the agents of a network have to solve an optimization problem with two key features: (i) the dimension of the decision variable depends on the network size, and (ii) cost ...
A dual approach has been combined with a coordinate proximal gradient in [23] to propose an asynchronous distributed algorithm for composite convex optimization. ...
arXiv:1805.08460v1
fatcat:jvv2nxtpyzapxbijxzf4twgksa
Robust Asynchronous Optimization for Volunteer Computing Grids
2009
2009 Fifth IEEE International Conference on e-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.
Volunteer computing grids offer significant computing power at relatively low cost to researchers, while at the same time generating public interest in different scientific projects. ...
An asynchronous version of particle swarm optimization (APSO) is presented and compared to previously used asynchronous genetic search (AGS) using the MilkyWay@Home BOINC computing project. ...
ACKNOWLEDGMENT We would like to thank our many volunteers for taking part in the MilkyWay@HOME BOINC computing project as this research would not be possible without them. ...
doi:10.1109/e-science.2009.44
dblp:conf/eScience/DesellMSVNC09
fatcat:gqtlajlhvvg5pkzgpqdaozbcdq
Design of asynchronous circuits using synchronous CAD tools
2002
IEEE Design & Test of Computers
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.
Poor CAD support hinders wide acceptance of asynchronous methodologies, and asynchronous design tools are far behind synchronous commercial tools. ...
A new design flow, NCL_X, based entirely on commercial CAD tools, targets a subclass of asynchronous circuits called null convention logic. ...
Acknowledgments We thank Karl Fant, Michiel Ligthart, Ross Smith, and Alexander Taubin for their invaluable help in discussing and implementing the NCL_X design flow. ...
doi:10.1109/mdt.2002.1018139
fatcat:6dogthchtjeozgzso7cxqpc5wm
Shifting the Frontiers of Analog and Mixed-Signal Electronics
2014
Advances in Electronics
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.
They form a bottleneck in the communication with the outside world, determine an upper bound in quality, yield, and flexibility for the IC, and require a significant part of the power dissipation. ...
optimized for the communication medium, to the optimal on-chip signal representation, the digital one, for the IC medium. ...
Cooperating with these highly qualified persons in an open atmosphere gave the author the opportunity to build up the vision presented in this paper. ...
doi:10.1155/2014/590970
fatcat:u6bor5jk5rdh7odub225oizzii
A Novel Content Distribution Mechanism in DHT Networks
[chapter]
2009
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 propose a novel content distribution algorithm: asynchronous distribution, in DHT networks. ...
Compared with traditional distribution approaches, it is more effective and scalable with lower network load. ...
We propose a novel asynchronous content distribution algorithm in DHT networks. Compared with traditional distribution approaches, it is more effective and scalable with lower network load. ...
doi:10.1007/978-3-642-01399-7_58
fatcat:oozitraygzgqnc5njx3rv7ciae
Concurrent Error Detection Methods for Asynchronous Burst-Mode Machines
2007
IEEE transactions on computers
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.
The second method (Transition-Triggered CED) is a variation of duplication wherein the implementation cost is reduced by allowing hazards in the duplicate circuit. ...
Therefore, performing effective CED in ABMMs requires the ability to detect hazards with which synchronous CED methods are not concerned. ...
Nowick from Columbia University for providing MINIMALIST, the burstmode logic synthesis package used in this work. ...
doi:10.1109/tc.2007.1025
fatcat:w3y4uf36fvfb3j5qc7lx5qas74
A Survey on Fault-tolerance in Distributed Optimization and Machine Learning
[article]
2021
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 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
With the rapid expansion of the scale of distributed systems, resilient distributed algorithms for optimization are needed, in order to mitigate system failures, communication issues, or even malicious ...
This survey investigates the current state of fault-tolerance research in distributed optimization, and aims to provide an overview of the existing studies on both fault-tolerant distributed optimization ...
A line of work shows the relationship between solvability and redundancy in cost functions. The cost functions of agents, although not identical, have underlying connections with each other. ...
arXiv:2106.08545v2
fatcat:g6fys4icrbbr5k3bd3ycylaptu
Asynchronous consensus for optimal power flow control in smart grid with zero power mismatch
2018
Journal of Modern Power Systems and Clean Energy
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.
In this paper we provide a distributed optimal power flow solution for a smart distribution network with separable global costs, separable non-convex constraints, and inseparable linear constraints, while ...
The consensus protocol is then combined with a fully distributed primal dual optimization utilizing an augmented Lagrange function to ensure convergence to a feasible solution with respect to power flow ...
Algorithm 2 was applied to the test network, initialized with a random feasible state with cost of 512.5, and resulted in the convergence of the Lagrange and cost functions to the cost of a centralized ...
doi:10.1007/s40565-018-0378-4
fatcat:dxr2zf543nhfzj5hjiktijcjxm
Shared work list
2012
Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores - PMAM '12
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.
In this paper, we first put forward Shared Work List to UPC and advocate a programming paradigm for writing applications with amorphous data parallelism on distributed memory systems. ...
Efficient mechanism of work dispatching and related optimizations are presented as well. ...
Compared with the explicit and complex optimization done in the MPI Simple version by hand, writing applications in SWL can helps users to achieve nearly the same optimization while at a low cost of programmability ...
doi:10.1145/2141702.2141716
dblp:conf/ppopp/XuC12
fatcat:7iynmiqowvhd3jpdo4uxvfd2wy
An Asynchronous, Decentralized Solution Framework for the Large Scale Unit Commitment Problem
[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.
Other Versions
In this paper we focus on developing an asynchronous decentralized solution framework for the Unit Commitment(UC) problem for large scale power networks. ...
With increased reliance on cyber infrastructure, large scale power networks face new challenges owing to computational scalability. ...
We augment the existing formulation with a redundant valid inequality based on production and demand to boost computational performance in an asynchronous system. ...
arXiv:1904.03560v1
fatcat:rhx2fn4zive4xgry7zgr2kdkoi
Profile-directed optimization of event-based programs
2002
SIGPLAN notices
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.
Because of this, the optimizations described in this paper are generally applicable to most such systems. ...
Such overheads can be surprisingly large, and are especially significant in small mobile systems. This paper describes a framework for profile-guided optimization of eventbased systems. ...
Additionally, a secondary benefit of inlining is the reduction in the cost associated with supporting variable numbers of arguments to a function. ...
doi:10.1145/543552.512543
fatcat:q6y5lxfsirgmlfws3izjrzqjz4
Profile-directed optimization of event-based programs
2002
Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation - PLDI '02
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.
Because of this, the optimizations described in this paper are generally applicable to most such systems. ...
Such overheads can be surprisingly large, and are especially significant in small mobile systems. This paper describes a framework for profile-guided optimization of eventbased systems. ...
Additionally, a secondary benefit of inlining is the reduction in the cost associated with supporting variable numbers of arguments to a function. ...
doi:10.1145/512541.512543
fatcat:alpz2ioo7ngzdpcr6v4roiwsyu
« Previous
Showing results 1 — 15 out of 16,840 results