Results 1  10
of
254
Quantum separation of local search and fixed point computation
 Proceedings of the 14th Annual International Computing and Combinatorics Conference, 2008
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
and Fixed Point Computation
"... In this paper, we give a lower bound of Ω(n (d−1)/2) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1: n] d. Our bound is nearly tight, as the Grover search algorithm can be used to find a fixed point with O(n d/2) quantum queries. Our result esta ..."
Abstract
 Add to MetaCart
point computation over grid [1: n] d, for d ≥ 4. Combining Aldous sampling with Grover search, Aaronson gave an algorithm for local search over [1: n] d that makes O(n d/3) quantum queries. Thus, the quantum query model over [1: n] d for d ≥ 4 strictly separates these two fundamental search problems. 1
The Determinants of Credit Spread Changes.
 Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract

Cited by 422 (2 self)
 Add to MetaCart
changes are principally driven by local supply/demand shocks that are independent of both creditrisk factors and standard proxies for liquidity. * CollinDufresne is at Carnegie Mellon University. Goldstein is at Washington University in St. Louis. Martin is at Arizona State University. A significant
Quantum
"... An improved formalism for quantum computation based on geometric algebra—case study: Grover’s search algorithm ..."
Abstract
 Add to MetaCart
An improved formalism for quantum computation based on geometric algebra—case study: Grover’s search algorithm
280; Ultraviolet stable fixed point and scaling relations
 in (2+epsilon)dimensional quantum gravity., UT636. Bulletin Board: hepth@xxx.lanl.gov  9303123
, 1993
"... We formulate a renormalizable quantum gravity in 2+ǫ dimensions by generalizing the nonlinear sigma model approach to string theory. We find that the theory possesses the ultraviolet stable fixed point if the central charge of the matter sector is in the range 0 < c < 25. This may imply the ex ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
the existence of consistent quantum gravity theory in 3 and 4 dimensions. We compute the scaling dimensions of the relevant operators in the theory at the ultraviolet fixed point. We obtain a scaling relation between the cosmological constant and the gravitational constant, which is crucial for searching
Title of Document: QUANTUM MECHANICS AND QUANTUM INFORMATION THEORY
"... The principle aim of this dissertation is to investigate the philosophical application of quantum information theory to interpretational issues regarding the theory of quantum mechanics. Recently, quantum information theory has emerged as a potential source for such an interpretation. The main quest ..."
Abstract
 Add to MetaCart
The principle aim of this dissertation is to investigate the philosophical application of quantum information theory to interpretational issues regarding the theory of quantum mechanics. Recently, quantum information theory has emerged as a potential source for such an interpretation. The main
Fixedpoint iterations in determining a Tikhonov regularization parameter
 Inverse Problems
"... We review a Tikhonov parameter criterion based on the search for local minima of the function µ(λ) = x(λ)yµ(λ), µ> 0 where x(λ) and y(λ) are the squared residual norm and the squared solution norm, respectively, proposed earlier by Regińska (1996, SIAM J. Sci. Comput. 3 740). As a consequence, ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We review a Tikhonov parameter criterion based on the search for local minima of the function µ(λ) = x(λ)yµ(λ), µ> 0 where x(λ) and y(λ) are the squared residual norm and the squared solution norm, respectively, proposed earlier by Regińska (1996, SIAM J. Sci. Comput. 3 740). As a consequence
Solving the Fixed Channel Assignment Problem in Cellular Communications Using an Adaptive Local Search
"... The Channel Assignment Problem can be defined as assigning a minimum number of radio frequencies to a set of transceiver/receiver units without violating given constraints, in particular the frequency separation that must exist between two given channels to avoid interference. Being an NPcompl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. In this paper, we present a greedy local search, combined with a monte carlo algorithm as an acceptance criteria. Our results are able to match lower bound conditions and beat existing approaches. Computational results are given. 1.
Towards a Formalization of Combinatorial Local Search
"... Abstract—Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. We are here concerned with the design of a generic framework to model local search as the computation of a fixed point of functions. This work allow ..."
Abstract
 Add to MetaCart
Abstract—Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. We are here concerned with the design of a generic framework to model local search as the computation of a fixed point of functions. This work
A Hybrid Algorithm of Local Search for the Heterogeneous Fixed Fleet Vehicle Routing Problem
, 2015
"... Abstract—Under consideration is the optimization problem for the routes of heterogeneous vehicles serving a given set of customers. It is assumed that the customers are represented by points in the plane, whereas the number of each type of vehicles is limited. To solve the problem, we developed a hy ..."
Abstract
 Add to MetaCart
hybrid local search algorithm with coding the solutions as a sequence of customers. To decode the sequence, the corresponding NPhard problem is solved by the method of Lagrangian relaxation. We propose new procedures for intensification and diversification of the search, as well as a new neighborhood
Results 1  10
of
254