Relevant bibliographies by topics / Oracle based algorithms

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Oracle based algorithms'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Oracle based algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Oracle based algorithms"

1

Zhao, Jiahao. "Possible Implementations of Oracles in Quantum Algorithms." Journal of Physics: Conference Series 2386, no. 1 (2022): 012010. http://dx.doi.org/10.1088/1742-6596/2386/1/012010.

Full text
Abstract:
Abstract Quantum computing is an inspiring technic on solving complicate problems, which shows the superiority over the classical computing. Contemporarily, the quantum-based algorithms were invented in many purposes on solving those problems. The thing is some of the algorithms were composed with oracles, which can be treated as a black box. It can be worked out/analyzed in theoretical mathematical expressions, but it can never fall in the ground without those actual implementations. Therefore, this paper will illustrate the idea and possible implementations on some quantum algorithm. Among v
APA, Harvard, Vancouver, ISO, and other styles
2

Hou, Wenjun, and Marek Perkowski. "Quantum-based algorithm and circuit design for bounded Knapsack optimization problem." Quantum Information and Computation 20, no. 9&10 (2020): 766–86. http://dx.doi.org/10.26421/qic20.9-10-4.

Full text
Abstract:
The Knapsack Problem is a prominent problem that is used in resource allocation and cryptography. This paper presents an oracle and a circuit design that verifies solutions to the decision problem form of the Bounded Knapsack Problem. This oracle can be used by Grover Search to solve the optimization problem form of the Bounded Knapsack Problem. This algorithm leverages the quadratic speed-up offered by Grover Search to achieve a quantum algorithm for the Knapsack Problem that shows improvement with regard to classical algorithms. The quantum circuits were designed using the Microsoft Q# Progr
APA, Harvard, Vancouver, ISO, and other styles
3

Kämmerling, Nicolas, and Jannis Kurtz. "Oracle-based algorithms for binary two-stage robust optimization." Computational Optimization and Applications 77, no. 2 (2020): 539–69. http://dx.doi.org/10.1007/s10589-020-00207-w.

Full text
Abstract:
Abstract In this work we study binary two-stage robust optimization problems with objective uncertainty. We present an algorithm to calculate efficiently lower bounds for the binary two-stage robust problem by solving alternately the underlying deterministic problem and an adversarial problem. For the deterministic problem any oracle can be used which returns an optimal solution for every possible scenario. We show that the latter lower bound can be implemented in a branch and bound procedure, where the branching is performed only over the first-stage decision variables. All results even hold
APA, Harvard, Vancouver, ISO, and other styles
4

Zhandry, Mark. "Secure identity-based encryption in the quantum random oracle model." International Journal of Quantum Information 13, no. 04 (2015): 1550014. http://dx.doi.org/10.1142/s0219749915500148.

Full text
Abstract:
We give the first proof of security for an identity-based encryption (IBE) scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that does not rely on the assumed existence of so-called quantum-secure pseudorandom functions (PRFs). Our techniques are quite general and we use them to obtain security proofs for two random oracle hierarchical IBE schemes and a random oracle signature scheme, all of which have previously resisted quantum security proofs, even assuming quantum-secure PRFs. We also explain how to remove quantum-secure PRFs from p
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Liyi, Finn Voichick, Kesha Hietala, Yuxiang Peng, Xiaodi Wu, and Michael Hicks. "Verified compilation of Quantum oracles." Proceedings of the ACM on Programming Languages 6, OOPSLA2 (2022): 589–615. http://dx.doi.org/10.1145/3563309.

Full text
Abstract:
Quantum algorithms often apply classical operations, such as arithmetic or predicate checks, over a quantum superposition of classical data; these so-called oracles are often the largest components of a quantum program. To ease the construction of efficient, correct oracle functions, this paper presents VQO, a high-assurance framework implemented with the Coq proof assistant. The core of VQO is OQASM, the oracle quantum assembly language. OQASM operations move qubits between two different bases via the quantum Fourier transform, thus admitting important optimizations, but without inducing enta
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Mengru, Yu Cai, Li Gao, et al. "Study on the evolution of Chinese characters based on few-shot learning: From oracle bone inscriptions to regular script." PLOS ONE 17, no. 8 (2022): e0272974. http://dx.doi.org/10.1371/journal.pone.0272974.

Full text
Abstract:
Oracle bone inscriptions (OBIs) are ancient Chinese scripts originated in the Shang Dynasty of China, and now less than half of the existing OBIs are well deciphered. To date, interpreting OBIs mainly relies on professional historians using the rules of OBIs evolution, and the remaining part of the oracle’s deciphering work is stuck in a bottleneck period. Here, we systematically analyze the evolution process of oracle characters by using the Siamese network in Few-shot learning (FSL). We first establish a dataset containing Chinese characters which have finished a relatively complete evolutio
APA, Harvard, Vancouver, ISO, and other styles
7

Mirhosseini, Seyyed Mohsen, and Hassan Haghighi. "Application of the Shuffled Frog Leaping Algorithm (SFLA) in Constructing Fuzzy Classification Systems." International Journal of Computational Intelligence and Applications 18, no. 03 (2019): 1950019. http://dx.doi.org/10.1142/s1469026819500196.

Full text
Abstract:
A Fuzzy Inference System (FIS) is a way of mapping an input space to an output space using the fuzzy logic. FISs are widely used to solve classification problems. The Shuffled Frog Leaping Algorithm (SFLA) is a metaheuristic inspired by the natural evolution of frogs in searching for the largest source of food. By using local and global searches simultaneously, SFLA is effective in solving various optimization problems. This paper first proposes a new method to create zero-order Sugeno Fuzzy Inference Systems using SFLA. Then, the paper introduces an approach to use resulting SFLA-based Fuzzy
APA, Harvard, Vancouver, ISO, and other styles
8

Paris, Matteo G. A., Claudia Benedetti, and Stefano Olivares. "Improving Quantum Search on Simple Graphs by Pretty Good Structured Oracles." Symmetry 13, no. 1 (2021): 96. http://dx.doi.org/10.3390/sym13010096.

Full text
Abstract:
Quantum search algorithms provide a way to speed up combinatorial search, and have found several applications in modern quantum technology. In particular, spatial search on graphs, based on continuous-time quantum walks (CTQW), represents a promising platform for the implementation of quantum search in condensed matter systems. CTQW-based algorithms, however, work exactly on complete graphs, while they are known to perform poorly on realistic graphs with low connectivity. In this paper, we put forward an alternative search algorithm, based on structuring the oracle operator, which allows one t
APA, Harvard, Vancouver, ISO, and other styles
9

Paris, Matteo G. A., Claudia Benedetti, and Stefano Olivares. "Improving Quantum Search on Simple Graphs by Pretty Good Structured Oracles." Symmetry 13, no. 1 (2021): 96. http://dx.doi.org/10.3390/sym13010096.

Full text
Abstract:
Quantum search algorithms provide a way to speed up combinatorial search, and have found several applications in modern quantum technology. In particular, spatial search on graphs, based on continuous-time quantum walks (CTQW), represents a promising platform for the implementation of quantum search in condensed matter systems. CTQW-based algorithms, however, work exactly on complete graphs, while they are known to perform poorly on realistic graphs with low connectivity. In this paper, we put forward an alternative search algorithm, based on structuring the oracle operator, which allows one t
APA, Harvard, Vancouver, ISO, and other styles
10

Yang, Zhen-Ping, Yuliang Wang, and Gui-Hua Lin. "Variance-Based Modified Backward-Forward Algorithm with Line Search for Stochastic Variational Inequality Problems and Its Applications." Asia-Pacific Journal of Operational Research 37, no. 03 (2020): 2050011. http://dx.doi.org/10.1142/s0217595920500116.

Full text
Abstract:
We propose a variance-based modified backward-forward algorithm with a stochastic approximation version of Armijo’s line search, which is robust with respect to an unknown Lipschitz constant, for solving a class of stochastic variational inequality problems. A salient feature of the proposed algorithm is to compute only one projection and two independent queries of a stochastic oracle at each iteration. We analyze the proposed algorithm for its asymptotic convergence, sublinear convergence rate in terms of the mean natural residual function, and optimal oracle complexity under moderate conditi
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Oracle based algorithms"

1

Gilbert, Hugo. "Oracle-based algorithms for optimizing sophisticated decision criteria in sequential, robust and fair decision problems." Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066648.

Full text
Abstract:
Cette thèse s'inscrit dans le cadre de la théorie de la décision algorithmique, qui est une discipline au croisement de la théorie de la décision, la recherche opérationnelle et l'intelligence artificielle. Dans cette thèse, nous étudions l'utilisation de plusieurs modèles décisionnels pour résoudre des problèmes de décision séquentielle dans l'incertain, d'optimisation robuste, et d'optimisation multi-agents équitable. Pour résoudre efficacement ces problèmes, nous utilisons des méthodes de type maître-esclaves, dites à base d'oracles dans la thèse. Ces méthodes permettent de résoudre des pro
APA, Harvard, Vancouver, ISO, and other styles
2

Hlosta, Martin. "Modul pro shlukovou analýzu systému pro dolování z dat." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237158.

Full text
Abstract:
This thesis deals with the design and implementation of a cluster analysis module for currently developing datamining system DataMiner on FIT BUT. So far, the system lacked cluster analysis module. The main objective of the thesis was therefore to extend the system of such a module. Together with me, Pavel Riedl worked on the module. We have created a common part for all the algorithms so that the system can be easily extended to other clustering algorithms. In the second part, I extended the clustering module by adding three density based clustering aglorithms - DBSCAN, OPTICS and DENCLUE. Al
APA, Harvard, Vancouver, ISO, and other styles
3

Lippold, Georg. "Encryption schemes and key exchange protocols in the certificateless setting." Thesis, Queensland University of Technology, 2010. https://eprints.qut.edu.au/41697/1/Georg_Lippold_Thesis.pdf.

Full text
Abstract:
The contributions of this thesis fall into three areas of certificateless cryptography. The first area is encryption, where we propose new constructions for both identity-based and certificateless cryptography. We construct an n-out-of- n group encryption scheme for identity-based cryptography that does not require any special means to generate the keys of the trusted authorities that are participating. We also introduce a new security definition for chosen ciphertext secure multi-key encryption. We prove that our construction is secure as long as at least one authority is uncompromised, and s
APA, Harvard, Vancouver, ISO, and other styles
4

Mena, Sihuacollo Joseph César. "Algoritmo para brindar alta disponibilidad de servidores base de datos Oracle no clusterizados." Bachelor's thesis, Universidad Nacional Mayor de San Marcos, 2018. https://hdl.handle.net/20.500.12672/8010.

Full text
Abstract:
Publicación a texto completo no autorizada por el autor<br>Describe el algoritmo para brindar alta disponibilidad de servidores de base de datos Oracle no clusterizados para una empresa del rubro de administración de pensiones. El problema se identifica cuando se inicia un requerimiento que necesitaba que la aplicación, producto de este requerimiento, tuviera disponibilidad 24x7. Para garantizar la disponibilidad de 24x7 o también llamada alta disponibilidad, se requiere servidores redundantes en los diferentes niveles de la arquitectura de la aplicación. La empresa en cuestión cuenta con serv
APA, Harvard, Vancouver, ISO, and other styles
5

Lagana, Antonio. "Quantum computation and a universal quantum computer." Thesis, 2012. http://hdl.handle.net/2440/77320.

Full text
Abstract:
This thesis covers two main topics in quantum computing: universal quantum computation and quantum search. We first demonstrate how a quantum harmonic oscillator can be used to implement the universal set of quantum gates and thereby serve as one possible building block for a universal quantum computer. We then address the core and primary focus of this thesis, the theoretical construction of a machine that can compute every computable function, that is, a universal (i.e.programmable) quantum computer. We thereby settle the questions that have been raised over the years regarding the validity
APA, Harvard, Vancouver, ISO, and other styles
6

Yoshida, Kayo. "Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem." Thesis, 2009. http://hdl.handle.net/10012/4219.

Full text
Abstract:
The Boneh-Boyen signature scheme is a short signature scheme which is provably secure in the standard model under the q-Strong Diffie-Hellman (SDH) assumption. The primary objective of this thesis is to examine the relationship between the Boneh-Boyen signature scheme and SDH. The secondary objective is to survey surrounding topics such as the generic group model, related signature schemes, intractability assumptions, and the relationship to identity-based encryption (IBE) schemes. Along these lines, we analyze the plausibility of the SDH assumption using the generic bilinear group model.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Oracle based algorithms"

1

Devraj, Venkat S. Oracle 24x7 Tips and Techniques. Osborne/McGraw-Hill, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Devraj, Venkat S. Oracle 24x7 Tips and Techniques. Osborne/McGraw-Hill, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Oracle based algorithms"

1

Lv, Pin, Xuetao Zhang, Jing Liu, Tingting Wei, and Jia Xu. "Blockchain Oracle-Based Privacy Preservation and Reliable Identification for Vehicles." In Wireless Algorithms, Systems, and Applications. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-86137-7_54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Elbassioni, Khaled, and Kazuhisa Makino. "Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs." In Sublinear Computation Paradigm. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-4095-7_4.

Full text
Abstract:
AbstractPacking and covering semidefinite programs (SDPs) appear in natural relaxations of many combinatorial optimization problems as well as a number of other applications. Recently, several techniques have been proposed that utilize the particular structure of this class of problems in order to obtain more efficient algorithms than those offered by general SDP solvers. For certain applications, it may be necessary to deal with SDPs with a very large number of (e.g., exponentially or even infinitely many) constraints. In this chapter, we give an overview of some of the techniques that can be used to solve this class of problems, focusing on multiplicative weight updates and logarithmic-potential methods.
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Peng, Cheng Wang, Xiangjun Song, Deliang Liu, and Wanling Li. "MSE Analysis Based on Nearly-Oracle Estimation for SCoSaMP Algorithm." In Lecture Notes in Electrical Engineering. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-6571-2_208.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Jiarui, Hong-Hin Cheong, and Shirley Weng In Siu. "BESTox: A Convolutional Neural Network Regression Model Based on Binary-Encoded SMILES for Acute Oral Toxicity Prediction of Chemical Compounds." In Algorithms for Computational Biology. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-42266-0_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Guo, Xiaolan, and Neha Jain. "Design and Implementation of Oral English Test System Based on Data Mining Algorithm." In Cyber Security Intelligence and Analytics. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96908-0_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Xi, Ke, Yufei Nie, Na Yang, Cheng Cai, and Aoxiang Zhang. "The WeChat Mini-program for Oral English Evaluation Based on the Smart Listening Algorithm." In Lecture Notes in Computer Science. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96419-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wolff, Mark. "Invoking the Oracle: Perec, Algorithms and Conceptual Writing." In The Afterlives of Georges Perec. Edinburgh University Press, 2017. http://dx.doi.org/10.3366/edinburgh/9781474401241.003.0005.

Full text
Abstract:
Although Georges Perec did not make use of computers in his writing, he employed algorithmic processes for structuring various formal and thematic elements of his texts. As a member of the Oulipo, he worked with others to develop new ways to write using constraints based on mathematics. In considering the effect of computational methods on writing, the Oulipo wanted to avoid the influence of chance without devising procedures that automated the writing process. Perec addressed this challenge by resorting to what he and other Oulipians, drawing on Lucretius, called the clinamen, a kind of randomizing function that promotes creativity through unpredictability. If constraints can be applied with a machine to writing (and many of the constraints used by Perec can be easily coded), the clinamen disrupts this computation and forces the writer to make unanticipated choices. Purposely thwarting the determinism of mechanical calculation, Perec’s irregular use of constraints on writing invokes what Alan Turing called an oracle, a resource outside the machine for performing uncomputable operations. Unlike a computer scientist who seeks to eliminate any need for an oracle by developing sufficient algorithms, Perec manipulates algorithms erratically in order to intervene in subverted computations and provide revelatory solutions that escape the machine.
APA, Harvard, Vancouver, ISO, and other styles
8

Pushkala V and S. Nirmala Devi. "Detection of Ketosis in Bovine Using Machine Learning Techniques." In Advances in Parallel Computing. IOS Press, 2021. http://dx.doi.org/10.3233/apc210054.

Full text
Abstract:
This paper presents the different unsupervised machine learning algorithms used for Ketosis detection, based on the color characteristics taken from the Ketocheck rapid colorimetric test. The level of ketone bodies in bovine’s urine is represented by three color categories, range of dark green (right ketone level), green (normal range ketone level) and yellow/orange (higher ketone level). The color image is converted into HSV color space for better color discrimination. The proposed technique enables detection of ketosis by clustering every pixel in the image using unsupervised K-means clustering and Fuzzy C Means (FCM) clustering algorithms. The results obtained have shown that K-means algorithm is faster and it also have low computational complexity. Two android application is developed. One with K-means clustering algorithm loaded in server and the other, directly programmed in android application.
APA, Harvard, Vancouver, ISO, and other styles
9

Jameel, Tahir, Mengxiang Lin, and Liu Chao. "Metamorphic Relations Based Test Oracles for Image Processing Applications." In Biometrics. IGI Global, 2017. http://dx.doi.org/10.4018/978-1-5225-0983-7.ch035.

Full text
Abstract:
Evaluation of output images carrying visual semantics is a challenging task which is carried out by domain experts through visual inspection. Automatic test oracle is required to augment the test oracle problem and to eliminate the manual efforts. Metamorphic testing is an effective technique to alleviate these problems. In this paper, the authors have demonstrated that how inherent properties of implementation under test can be used to generate an automatic test oracle for image processing applications. Metamorphic testing is a general technique in which follow-up test cases are generated using a transformation function and the anticipated output is evaluated. They have used some general metamorphic relations and also designed some algorithm specific metamorphic relations for morphological image operations. Selection of metamorphic relations is the most important step and the authors have analyzed relative effectiveness of different metamorphic relations using mutation analysis. The results show metamorphic testing is a very effective technique to automate output images evaluation and to alleviate oracle problem.
APA, Harvard, Vancouver, ISO, and other styles
10

Khan, Binish, Piyush Kumar Shukla, Manish Kumar Ahirwar, and Manish Mishra. "Strategic Analysis in Prediction of Liver Disease Using Different Classification Algorithms." In Handbook of Research on Disease Prediction Through Data Analytics and Machine Learning. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-2742-9.ch022.

Full text
Abstract:
Liver diseases avert the normal activity of the liver. Discovering the presence of liver disorder at an early stage is a complex task for the doctors. Predictive analysis of liver disease using classification algorithms is an efficacious task that can help the doctors to diagnose the disease within a short duration of time. The main motive of this study is to analyze the parameters of various classification algorithms and compare their predictive accuracies so as to find the best classifier for determining the liver disease. This chapter focuses on the related works of various authors on liver disease such that algorithms were implemented using Weka tool that is a machine learning software written in Java. Also, orange tool is utilized to compare several classification algorithms in terms of accuracy. In this chapter, random forest, logistic regression, and support vector machine were estimated with an aim to identify the best classifier. Based on this study, random forest with the highest accuracy outperformed the other algorithms.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Oracle based algorithms"

1

Zhang, Chongsheng, Ruixing Zong, Shuang Cao, Yi Men, and Bofeng Mo. "AI-Powered Oracle Bone Inscriptions Recognition and Fragments Rejoining." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/779.

Full text
Abstract:
Oracle Bone Inscriptions (OBI) research is very meaningful for both history and literature. In this paper, we introduce our contributions in AI-Powered Oracle Bone (OB) fragments rejoining and OBI recognition. (1) We build a real-world dataset OB-Rejoin, and propose an effective OB rejoining algorithm which yields a top-10 accuracy of 98.39%. (2) We design a practical annotation software to facilitate OBI annotation, and build OracleBone-8000, a large-scale dataset with character-level annotations. We adopt deep learning based scene text detection algorithms for OBI localization, which yield a
APA, Harvard, Vancouver, ISO, and other styles
2

Gomes, Christian, Leonardo Rocha, and Marcos Gonçalves. "On the Cost-Effectiveness of Stacking of Neural and Non-Neural Methods for Text Classification: Scenarios and Performance Prediction." In Concurso de Teses e Dissertações. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/ctd.2022.222665.

Full text
Abstract:
Nowadays, neural networks algorithms, such as those based on Attention and Transformers, have excelled on Automatic Text Classification (ATC). However, such enhanced performance comes at high computational costs. Stacking of simpler classifiers that exploit algorithmic and representational complementarity has also been shown to produce superior performance in ATC, enjoying high effectiveness and potentially lower computational costs than complex neural networks. In this master's thesis, we present the first and largest comparative study to exploit the cost-effectiveness of Stacking in ATC, con
APA, Harvard, Vancouver, ISO, and other styles
3

Abla, Parhat. "Lattice Based Group Key Exchange Protocol in the Standard Model." In 2nd International Conference on Machine Learning &Trends (MLT 2021). AIRCC Publishing Corporation, 2021. http://dx.doi.org/10.5121/csit.2021.111113.

Full text
Abstract:
Group key exchange schemes allow group members to agree on a session key. Although there are many works on constructing group key exchange schemes, but most of them are based on algebraic problems which can be solved by quantum algorithms in polynomial time. Even if several works considered lattice based group key exchange schemes, believed to be post-quantum secure, but only in the random oracle model. In this work, we propose a group key exchange scheme based on ring learning with errors problem. On contrast to existing schemes, our scheme is proved to be secure in the standard model. To ach
APA, Harvard, Vancouver, ISO, and other styles
4

Soos, Mate, and Kuldeep S. Meel. "Gaussian Elimination Meets Maximum Satisfiability." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/55.

Full text
Abstract:
Given a set of constraints F and a weight function W over the assignments, the problem of MaxSAT is to compute a maximum weighted solution of F. MaxSAT is a fundamental problem with applications in numerous areas. The success of MaxSAT solvers has prompted researchers in AI and formal methods communities to develop algorithms that can use MaxSAT solver as oracle. One such problem that stands to benefit from advances in MaxSAT solving is discrete integration. Recently, Ermon et al. achieved a significant breakthrough by reducing the problem of integration to polynomially many queries to an opti
APA, Harvard, Vancouver, ISO, and other styles
5

Rangan, Ravi M., Kenneth Maddux, and William Duwe. "A Practical Methodology to Automate Routine and Data Intensive Design Activities." In ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium collocated with the ASME 1994 Design Technical Conferences. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/edm1994-0506.

Full text
Abstract:
Abstract Many engineering enterprises are involved in routine design operations. Routine design, in such cases, is concerned with varying the size and/or configuration of the chosen system using established solution principles, i.e. no new solution principles are introduced. However, in most engineering environments that deliver custom products to customers, the processes followed in ensuring that these routine designs are viable, are dependent on complex interactions within the organization. For example, customer delivery requirements may dictate material selection based on timely availabilit
APA, Harvard, Vancouver, ISO, and other styles
6

van Bremen, Timothy, and Ondrej Kuzelka. "Approximate Weighted First-Order Model Counting: Exploiting Fast Approximate Model Counters and Symmetry." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/587.

Full text
Abstract:
We study the symmetric weighted first-order model counting task and present ApproxWFOMC, a novel anytime method for efficiently bounding the weighted first-order model count of a sentence given an unweighted first-order model counting oracle. The algorithm has applications to inference in a variety of first-order probabilistic representations, such as Markov logic networks and probabilistic logic programs. Crucially for many applications, no assumptions are made on the form of the input sentence. Instead, the algorithm makes use of the symmetry inherent in the problem by imposing cardinality c
APA, Harvard, Vancouver, ISO, and other styles
7

You, Chong, Chun-Guang Li, Daniel P. Robinson, and Rene Vidal. "Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering." In 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2016. http://dx.doi.org/10.1109/cvpr.2016.426.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Perez, Rodrigo, and Verónica Alonso. "A unique application and point of truth for Naval Architecture Calculations." In SNAME 5th World Maritime Technology Conference. SNAME, 2015. http://dx.doi.org/10.5957/wmtc-2015-108.

Full text
Abstract:
Many tools handle with the calculation of compartment definition, hydrostatics, intact and damage stability and power prediction, but these calculations are separated from the rest of ship CAD/CAM tools. Ship designers need to work closely with the shipyards, in a complex and distributed environment making necessary to have suitable tools at early design stages to ensure profitable projects. Naval architecture is handled in FORAN with a revolutionary approach, where integration and advanced features are the relevant characteristics in a single and complete set of applications that are used in
APA, Harvard, Vancouver, ISO, and other styles
9

Xue, Feng, Qiaoling Chen, and Yang Zhang. "A Doppler frequency estimation algorithm based on band mismatch." In 2014 IEEE International Conference on Orange Technologies (ICOT). IEEE, 2014. http://dx.doi.org/10.1109/icot.2014.6956603.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sung-Lin Tsai, Ming-Kun Chen, Min-Haw Wang, and Ling-Sheng Jang. "EIS algorithm based on single-cell impedance system." In 2013 1st International Conference on Orange Technologies (ICOT 2013). IEEE, 2013. http://dx.doi.org/10.1109/icot.2013.6521171.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Oracle based algorithms"

1

Burks, Thomas F., Victor Alchanatis, and Warren Dixon. Enhancement of Sensing Technologies for Selective Tree Fruit Identification and Targeting in Robotic Harvesting Systems. United States Department of Agriculture, 2009. http://dx.doi.org/10.32747/2009.7591739.bard.

Full text
Abstract:
The proposed project aims to enhance tree fruit identification and targeting for robotic harvesting through the selection of appropriate sensor technology, sensor fusion, and visual servo-control approaches. These technologies will be applicable for apple, orange and grapefruit harvest, although specific sensor wavelengths may vary. The primary challenges are fruit occlusion, light variability, peel color variation with maturity, range to target, and computational requirements of image processing algorithms. There are four major development tasks in original three-year proposed study. First, s
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography