7,309 Hits in 11.2 sec

Best-First Enumeration Based on Bounding Conflicts, and its Application to Large-scale Hybrid Estimation

Eric Michael Timmons, Brian Charles Williams
2020 The Journal of Artificial Intelligence Research  
This paper presents a general best-first enumeration algorithm based on bounding conflicts (A*BC) and a hybrid estimation method using this enumeration algorithm.  ...  Discrete, consistency based state estimation capabilities can scale to this level by combining best-first enumeration and conflict-directed search.  ...  Acknowledgments The authors wish to thank the many researchers in the MIT MERS group who provided feedback on this paper, as well as the anonymous reviewers for their invaluable feedback and efforts to  ... 
doi:10.1613/jair.1.11892 fatcat:tr5jyzmdlrafzm2cnvfdiz7feq

Best-first Enumeration Based on Bounding Conflicts, and its Application to Large-scale Hybrid Estimation (Extended Abstract)

Eric Timmons, Brian C. Williams
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
Classical, consistency based diagnosis methods scale to this level by combining best-first enumeration and conflict-directed search.  ...  State estimation methods based on hybrid discrete and continuous state models have emerged as a method of precisely computing belief states for real world systems, however they have difficulty scaling  ...  Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence Journal Track  ... 
doi:10.24963/ijcai.2020/707 dblp:conf/ijcai/HoheneckerL20 fatcat:b4fsi5w4fbgyjebqcnifojqb64

Hybrid Estimation of Complex Systems

M.W. Hofbaur, B.C. Williams
2004 IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)  
It utilizes search techniques from the toolkit of model-based reasoning in order to focus the estimation on the set of most likely modes, without missing symptoms that might be hidden amongst the system  ...  Modeling these systems leads to complex stochastic hybrid models that capture the large number of operational and failure modes.  ...  As a consequence, our search-based successor enumeration scheme provides the leading estimate upon its first call to A* search and any consecutive call provides the next best successor in the order of  ... 
doi:10.1109/tsmcb.2004.835009 pmid:15503515 fatcat:4ydgfiyrjjcrlo5caucfq3avdm

Recurrence-Aware Instruction Set Selection for Extensible Embedded Processors

P. Bonzini, L. Pozzi
2008 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
We divide the problem into several parts, and concentrate on covering, that is selecting a set of non-overlapping and possibly recurrent custom instructions to be implemented and used.  ...  We propose an optimal search technique that uses branchand-bound to improve an existing solution, in conjunction with a greedy search to help the algorithm out of any local optima, and achieve a tangible  ...  The proposed algorithms include optimal search based on branch-and-bound, as well as approximate techniques.  ... 
doi:10.1109/tvlsi.2008.2001863 fatcat:kyoj7ddzgvet7psnqkqmiiokcq

mplrs: A scalable parallel vertex/facet enumeration code [article]

David Avis, Charles Jordan
2017 arXiv   pre-print
We describe a new parallel implementation, mplrs, of the vertex enumeration code lrs that uses the MPI parallel environment and can be run on a network of computers.  ...  Roumanis in C++. plrs uses the Boost library and runs on a shared memory machine.  ...  So we scaled up this running time using the known total number of bases given in Table 1 1 Estimate based on scaling a partial run on the same machine.  ... 
arXiv:1511.06487v4 fatcat:mb2buvts6vhapg75dugxlbc4iu

mts: A light framework for parallelizing tree search codes [article]

David Avis, Charles Jordan
2019 arXiv   pre-print
It abstracts and generalizes the ideas used in parallelizing lrs, a reverse search code for vertex enumeration. mts supports sharing information between processes which is important for applications such  ...  as satisfiability testing and branch-and-bound.  ...  This work was partially supported by JSPS Kakenhi Grants 16H02785, 18K18027, 23700019 and 15H00847, Grant-in-Aid for Scientific Research on Innovative Areas, 'Exploring the Limits of Computation (ELC)'  ... 
arXiv:1709.07605v2 fatcat:xgcjiw34xnafzmj7qm333wu6ta

Resolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation

Peng Yu, Brian Williams, Cheng Fang, Jing Cui, Patrik Haslum
2017 The Journal of Artificial Intelligence Research  
In our benchmark experiments, BCDR has also demonstrated its efficiency on solving large-scale scheduling problems in the aforementioned domains.  ...  It generalizes the discrete conflicts and relaxations, to hybrid conflicts and relaxations, which denote minimal inconsistencies and minimal relaxations to both discrete and continuous relaxable constraints  ...  Acknowledgments We would like to thank Eric Timmons, Christian Muise, Andrew Wang, Yuening Zhang and Szymon Sidor for discussing and reviewing the work.  ... 
doi:10.1613/jair.5431 fatcat:vfnwbyzxybdmxogdpi5s5jbsre

Application of an evolutionary algorithm-based ensemble model to job-shop scheduling

Choo Jun Tan, Siew Chin Neoh, Chee Peng Lim, Samer Hanoun, Wai Peng Wong, Chu Kong Loo, Li Zhang, Saeid Nahavandi
2017 Journal of Intelligent Manufacturing  
However, it is well-known that the enumeration-based methods are time-consuming, and are not efficient for large-scale problems [62] , [49] .  ...  The first is enumeration-based methods that utilise dynamic programming or branch-and-bound techniques to find the optimal solution.  ...  E for the enumeration method, and the single and ensemble MmGA models for job-shop scheduling Enumeration Method MmGA [57] Proposed MmGA ensemble (worst to best) [57] Lower Bound Mean Upper  ... 
doi:10.1007/s10845-016-1291-1 fatcat:etynw7ww5rhzrmd6nstryulyw4

Model-Based Programming of Fault-Aware Systems

Brian C. Williams, Michel D. Ingham, Seung Chung, Paul Elliott, Michael W. Hofbaur, Gregory T. Sullivan
2004 The AI Magazine  
Model-based programming is being generalized to hybrid discrete-continuous systems and the coordination of networks of robotic vehicles. Articles  ...  A model-based program is state and fault aware; it elevates the programming task to specifying intended state evolutions of a system.  ...  Acknowledgments We would like to thank Vineet Gupta, whose early collaboration and work on timed and hybrid concurrent constraint languages has deeply influenced this work.  ... 
doi:10.1609/aimag.v24i4.1731 dblp:journals/aim/WilliamsICEHS04 fatcat:gjybu3orbjgytdp6reg3shorxi

On Optimizing Operator Fusion Plans for Large-Scale Machine Learning in SystemML [article]

Matthias Boehm, Berthold Reinwald, Dylan Hutchison, Alexandre V. Evfimievski, Prithviraj Sen
2018 arXiv   pre-print
Many large-scale machine learning (ML) systems allow specifying custom ML algorithms by means of linear algebra programs, and then automatically generate efficient execution plans.  ...  However, existing fusion heuristics struggle to find good fusion plans for complex DAGs or hybrid plans of local and distributed operations.  ...  INTRODUCTION Large-scale machine learning (ML) aims to build predictive models from large data collections [20] and commonly relies on data-parallel frameworks such as MapReduce [25] and Spark [93  ... 
arXiv:1801.00829v1 fatcat:2r56mydh4zbmtcjqd5ktacbe34

Radio Frequency Link and User Selection Algorithm for 5G Mobile Communication System

Zhengnan Lv, Zhenghao Xi, Zhihan Lv
2021 Complexity  
A low-complexity multiuser hybrid precoding design scheme is proposed based on the wideband millimetre-wave large-scale Multiple-Input Multiple-Output (MIMO) system.  ...  The algorithm is based on the correlation dictionary and achieves the efficient and optimal selection of large-scale antenna arrays in the millimetre-wave band.  ...  Among the antenna selection algorithms, the exhaustive enumeration algorithm is one of the best and most widely known methods.  ... 
doi:10.1155/2021/1976499 fatcat:lmdcdx5atvbqdieekui2lfo7my

Hybrid metaheuristics in combinatorial optimization: A survey

Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli
2011 Applied Soft Computing  
Nowadays the focus is on solving the problem at hand in the best way possible, rather than promoting a certain metaheuristic.  ...  Hereby, hybridization is not restricted to the combination of different metaheuristics but includes, for example, the combination of exact algorithms and metaheuristics.  ...  It has its origins in attempts to deal with the curse of dimensionality [148] in large-scale DP applications.  ... 
doi:10.1016/j.asoc.2011.02.032 fatcat:zqdrzkmdlbcozin6isvt7pk3si

On optimal comparability editing with applications to molecular diagnostics

Sebastian Böcker, Sebastian Briesemeister, Gunnar W Klau
2009 BMC Bioinformatics  
Results: We present two new approaches for the problem based on fixed-parameter algorithmics and integer linear programming.  ...  In addition to the superior running time performance, our algorithms are capable of enumerating all optimal solutions, and naturally solve the weighted version of the problem.  ...  Acknowledgements We thank Rainer Spang's group in Regensburg and, in particular, Juby Jacob for providing us with the data from [1] .  ... 
doi:10.1186/1471-2105-10-s1-s61 pmid:19208165 pmcid:PMC2648753 fatcat:k3gaws2ttjhrvdqppmjyjodtji

Branch and Bound Algorithm and an Improvement for Calculating the Nearest Link of Building a Railway Network

Waleed Mohammed Elaibi
2020 Mustansiriyah Journal of Science  
In this paper, we discussed five cases with respect to branching decisions based on network solutions to calculate the nearest link with a short time.  ...  The importance of branch and bound algorithm is the mathematical improvement to find the value of (X) that Maximize or minimize the objective function within a set of feasible solution, as it is reliable  ...  ACKNOWLEDGEMENTS The researchers gratefully acknowledge Mustansiriyah University, College of Administration and Economics / Department of Statistics.  ... 
doi:10.23851/mjs.v31i4.923 fatcat:q4ql3jx2wjasvdq7bckbaq2xxy

Fast Lattice Point Enumeration with Minimal Overhead [chapter]

Daniele Micciancio, Michael Walter
2014 Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms  
Enumeration algorithms are the best currently known methods to solve lattice problems, both in theory (within the class of polynomial space algorithms), and in practice (where they are routinely used to  ...  We introduce a new class of (polynomial space) lattice enumeration algorithms that simultaneously achieve asymptotic efficiency (meeting the theoretical n O(n) = 2 O(n log n) time bound) and practicality  ...  To determine the practical complexity of the enumeration on reduced bases, we selected a model based on our theoretical analysis, f (n) = 2 c 1 n 2 · n c 2 n · 2 c 3 n , and fitted it to the data collected  ... 
doi:10.1137/1.9781611973730.21 dblp:conf/soda/MicciancioW15 fatcat:wf3jvwa47falzk4nuabsayq2yi
« Previous Showing results 1 — 15 out of 7,309 results