135,666 Hits in 9.0 sec

State Exchange with Quantum Side Information

Yonghae Lee, Ryuji Takagi, Hayata Yamasaki, Gerardo Adesso, Soojoon Lee
2019 Physical Review Letters  
In this work, we derive general upper and lower bounds for the least amount of entanglement which is necessary to perfectly perform this task, called the state exchange with quantum side information.  ...  We finally provide conditions on the initial state for the state exchange with quantum side information which give the exact optimal entanglement cost.  ...  We would like to thank Ludovico Lami, Bartosz Regula, and Mario Berta for fruitful discussion.  ... 
doi:10.1103/physrevlett.122.010502 fatcat:m64xpufx65et7khgcyxftjh2gi

Performance Bounds for Pairwise Entity Resolution [article]

Matt Barnes, Kyle Miller, Artur Dubrawski
2015 arXiv   pre-print
We prove simple bounding properties between the performance of a match function on a small validation set and the performance of a pairwise entity resolution algorithm on arbitrarily sized datasets.  ...  Thus, our approach enables optimization of pairwise entity resolution algorithms for large datasets, using a small set of labeled data.  ...  These match and merge functions form a conservative strategy, but provide the lower bound optimal performance given only labeled pairs.  ... 
arXiv:1509.03302v1 fatcat:3qrgst7m45bahjwwrvkl6y2mqe

A practical method for multi-domain clock skew optimization

Yanling Zhi, Hai Zhou, Xuan Zeng
2011 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)  
A framework based on branch-and-bound is carefully designed to search for the optimal clocking domain assignment, and a greedy clustering algorithm is developed to quickly estimate the upper bound of cycle  ...  period for a given branch.  ...  The authors would like to thank Jonas Casanova and Jordi Cortadella for providing the timing data for ISCAS89 benchmarks, and Wai-shing Luk for giving the important idea on how to determine the order of  ... 
doi:10.1109/aspdac.2011.5722245 dblp:conf/aspdac/ZhiZZ11 fatcat:xlgqrzqdsvevrffonsgweglj4i

Analyzing efficient stream processing on modern hardware

Steffen Zeuch, Bonaventura Del Monte, Jeyhun Karimov, Clemens Lutz, Manuel Renz, Jonas Traub, Sebastian Breß, Tilmann Rabl, Volker Markl
2019 Proceedings of the VLDB Endowment  
, and optimized windowing.  ...  Many SPEs execute processing pipelines using message passing on sharednothing architectures and apply a partition-based scale-out strategy to handle high-velocity input streams.  ...  This work was funded by the EU projects E2Data (780245), DFG Priority Program "Scalable Data Management for Future Hardware" (MA4662-5), and the German Ministry for Education and Research as BBDC I (01IS14013A  ... 
doi:10.14778/3303753.3303758 fatcat:3ugpwvys3vf2vba2npn2n2t47m

Fast Compaction Algorithms for NoSQL Databases

Mainak Ghosh, Indranil Gupta, Shalmoli Gupta, Nirman Kumar
2015 2015 IEEE 35th International Conference on Distributed Computing Systems  
We then propose a set of algorithms and mathematically analyze upper bounds on worst-case cost. We evaluate the proposed algorithms on real-life workloads.  ...  Our results show that our algorithms incur low I/O costs compared to optimal and that a compaction approach using a balanced tree is most preferable.  ...  We thank Chandra Chekuri for helpful discussions and insightful ideas regarding proofs and plots.  ... 
doi:10.1109/icdcs.2015.53 dblp:conf/icdcs/GhoshGGK15 fatcat:xkonhco3ozebrhsv4kpg35jnnq

Strategies of Merging Compressors for Capital Cost Reduction in Hydrogen Networks Synthesis

Xiaoqiang Liang, Yongzhong Liu
2017 Process Integration and Optimization for Sustainability  
The proposed strategies consider the upper capacity bound of a compressor and the capital cost of the compressors, and do not change the optimal matches of hydrogen sources and hydrogen sinks.  ...  To solve this problem, a method of compressor merging is proposed in this work, in which two strategies of merging compressors are proposed, namely, the hydrogen sources oriented compressors merging strategy  ...  Compliance with Ethical Standards Conflict of Interest On behalf of all authors, the corresponding author states that there is no conflict of interest.  ... 
doi:10.1007/s41660-017-0017-y fatcat:g6rd67jbdrd4naerqj6b54cvru

How to Dynamically Merge Markov Decision Processes

Satinder P. Singh, David Cohn
1997 Neural Information Processing Systems  
We analyze various aspects of our algorithm and illustrate its use on a simple merging problem.  ...  We are frequently called upon to perform multiple tasks that compete for our attention and resource.  ...  We have presented a modified value iteration algorithm for dynamically merging MDPs, proved its convergence, and illustrated its use on a simple merging task.  ... 
dblp:conf/nips/SinghC97 fatcat:rx4h2dh7nffv7azwk4ukjuytse

A Grouping Based Cooperative Driving Strategy for CAVs Merging Problems [article]

Huile Xu, Shuo Feng, Yi Zhang, Li Li
2018 arXiv   pre-print
In general, there are two kinds of cooperative driving strategies, planning based strategy and ad hoc negotiation based strategy, for connected and automated vehicles (CAVs) merging problems.  ...  In this paper, we propose a grouping based cooperative driving strategy to make a good tradeoff between time consumption and coordination performance.  ...  This histogram intuitively describes the performance of solutions. Fig.6 gives such a histogram for solution values for a merging scenario with 25 CAVs.  ... 
arXiv:1804.01250v1 fatcat:c2eawabhzrfljkkgfishvew44y

Supervised Assessment of Segmentation Hierarchies [chapter]

Jordi Pont-Tuset, Ferran Marques
2012 Lecture Notes in Computer Science  
We model the problem as a Linear Fractional Combinatorial Optimization (LFCO) problem, which makes the upper-bound selection feasible and efficient.  ...  Assessment results, therefore, depend on the partition selection strategy used.  ...  ODS and OIS F b values for the merging-sequence and upper-bound partition selection techniques  ... 
doi:10.1007/978-3-642-33765-9_58 fatcat:76ig3for4va4nmwhteq4fdjdiu

A distributed framework for solving the Multiagent Plan Coordination Problem

Jeffrey S. Cox, Edmund H. Durfee, Thomas Bartold
2005 Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems - AAMAS '05  
We then demonstrate how we can take advantage of novel flaw-assignment strategies and plan coordination algorithms to significantly improve the performance of ADOPT on representative coordination problems  ...  We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Constraint Optimization Problem  ...  The authors would like to thank Pragnesh Jay Modi and Milind Tambe for their valuable assistance.  ... 
doi:10.1145/1082473.1082598 dblp:conf/atal/CoxDB05 fatcat:g5pjxir2bbebva3sj4ohsnixhu

IOS: Inter-Operator Scheduler for CNN Acceleration [article]

Yaoyao Ding, Ligeng Zhu, Zhihao Jia, Gennady Pekhimenko, Song Han
2021 arXiv   pre-print
However, a single operator can no longer fully utilize the available parallelism given the rapid advances in high-performance hardware, resulting in a large gap between the peak performance and the real  ...  To accelerate CNN inference, existing deep learning frameworks focus on optimizing intra-operator parallelization.  ...  For the "operator merge" strategy, if all the operators in S can be merged into a single operator (L26), we merge them and measure the latency of the merged operator (L27).  ... 
arXiv:2011.01302v2 fatcat:cisjar7tjrcszgcjer2rxdjhse

An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse

Yongjia Song, James Luedtke
2015 SIAM Journal on Optimization  
A partition-based formulation is a relaxation of the original stochastic program, and we study a finitely converging algorithm in which the partition is adaptively adjusted until it yields an optimal solution  ...  In addition to refinement, we show that in the case of stochastic linear programs, it is possible to merge some components in a partition, without weakening the corresponding relaxation bound, thus allowing  ...  We greatly appreciate the comments and suggestions of the editors and two anonymous referees.  ... 
doi:10.1137/140967337 fatcat:rotqwkc2fjb2tf3p6vzbbru6m4

Bidirectional Search for Interactive Motion Synthesis

Wan-Yen Lo, Matthias Zwicker
2010 Computer graphics forum (Print)  
Our main contribution is a bidirectional search algorithm. We dynamically divide the search space evenly and merge two search trees to obtain the final solution.  ...  We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs.  ...  Thanks to Peng Du, Will Chang, Toshiya Hachisuka for the invaluable discussion and feedback, and to the anonymous reviewers for their helpful comments.  ... 
doi:10.1111/j.1467-8659.2009.01626.x fatcat:hvklg3see5cjje2fy2le7k5zai

Scheduling Algorithms in Cloud Computing - An Extensive Survey

S. Saranya Devi, V. Venkatesa Kumar, M. Newlin Rajkumar
2017 International Journal of Trend in Scientific Research and Development  
To achieve effective management of the available resources in a scalable environment optimal mechanism is required. In order to do this, choosing of scheduling algorithm is important.  ...  The scheduling techniques should be selected in such a way that the various user demands are satisfied.  ...  Based on this observation, we aim at designing efficient Virtual Machines assignment and scheduling strategies in which we consider optimizing both the operational cost of the data center and the performance  ... 
doi:10.31142/ijtsrd5840 fatcat:47qxzum2gjf45b5ap2so4mrxte

An improved multiscale method for life-cycle production optimization

Diego F. B. Oliveira, Albert C. Reynolds, Jan Dirk Jansen
2015 Computational Geosciences  
This work proposes a new hierarchical multiscale optimization technique to improve the performance of lifecycle production optimization.  ...  hierarchical multiscale optimization methods on which it is based.  ...  The first author also acknowledges the support provided by Petrobras S/A.  ... 
doi:10.1007/s10596-015-9530-7 fatcat:pzxh6n6xm5bpzpdygqizlgx3fu
« Previous Showing results 1 — 15 out of 135,666 results