نتایج جستجو برای: extended binary search

تعداد نتایج: 612735  

Journal: :The Annals of Applied Probability 2001

Journal: :Concurrency and Computation: Practice and Experience 2018

2008
Yale Fan

This paper generalizes both the binary Deutsch-Jozsa and Grover algorithms to n-valued logic using the quantum Fourier transform. Our extended Deutsch-Jozsa algorithm is not only able to distinguish between constant and balanced Boolean functions in a single query, but can also find closed expressions for classes of affine logical functions in quantum oracles, accurate to a constant term. Furth...

A. Afshar, S. Madadgar,

Most real world engineering design problems, such as cross-country water mains, include combinations of continuous, discrete, and binary value decision variables. Very often, the binary decision variables associate with the presence and/or absence of some nominated alternatives or project’s components. This study extends an existing continuous Ant Colony Optimization (ACO) algorithm to simultan...

2001
Sivakumar Nagarajan Scott D. Goodwin Abdul Sattar

Non binary constraints have recently been studied quite extensively since they represent real life problems very naturally. Specifically, extensions to binary arc consistency into generalised arc consistency (GAC), and forward checking that incorporates a limited amount of GAC have been proposed, to handle non-binary constraints directly. Enforcing arc consistency on the dual encoding has been ...

2014
Brigitte CHAUVIN

2 Binary search trees 2 2.1 Definition of a binary search tree . . . . . . . . . . . . . . . . . . 2 2.2 Profile of a binary search tree . . . . . . . . . . . . . . . . . . . . 3 2.2.1 Level polynomial. BST martingale . . . . . . . . . . . . . 3 2.2.2 Embedding in continuous time. Yule tree . . . . . . . . . . 6 2.2.3 Connection Yule tree binary search tree . . . . . . . . . . 7 2.2.4 Asymptoti...

Journal: :CoRR 2015
Thanh-Toan Do Anh-Zung Doan Ngai-Man Cheung

This paper addresses the problem of learning binary hash codes for large scale image search by proposing a novel hashing method based on deep neural network. The advantage of our deep model over previous deep model used in hashing is that our model contains necessary criteria for producing good codes such as similarity preserving, balance and independence. Another advantage of our method is tha...

2006
Gerth Stølting Brodal Gabriel Moruz

2004
Arne Andersson Rolf Fagerberg Kim S. Larsen

University of Southern Denmark 10.

2000
R. Launhardt A. I. Sargent H. Zinnecker

In an effort to shed more light on the formation process of binary stars, we have started a program to study multiplicity among nearby low-and intermediate-mass protostars using the OVRO Millimeter Array. Here, we describe the project and present the first results on the protostellar core in the Bok globule CB 230 (L 1177). At 10 ′′ resolution , the molecular core is resolved into two component...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید