Results 1  10
of
270
Almost) tight bounds for randomized and quantum local search on hypercubes and grids
, 2005
"... The Local Search problem, which finds a local minimum of a blackbox function on a given graph, is of both practical and theoretical importance to many areas in computer science and natural sciences. In this paper, we show that for the Boolean hypercube {0, 1} n, the randomized query complexity of L ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The Local Search problem, which finds a local minimum of a blackbox function on a given graph, is of both practical and theoretical importance to many areas in computer science and natural sciences. In this paper, we show that for the Boolean hypercube {0, 1} n, the randomized query complexity
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
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
Electronic Colloquium on Computational Complexity, Report No. 41 (2005) (Almost) tight bounds for randomized and quantum Local Search on hypercubes and grids ∗
"... The Local Search problem, which finds a local minimum of a blackbox function on a given graph, is of both practical and theoretical importance to many areas in computer science and natural sciences. In this paper, we show that for the Boolean hypercube {0, 1} n, the randomized query complexity of L ..."
Abstract
 Add to MetaCart
The Local Search problem, which finds a local minimum of a blackbox function on a given graph, is of both practical and theoretical importance to many areas in computer science and natural sciences. In this paper, we show that for the Boolean hypercube {0, 1} n, the randomized query complexity
New upper and lower bounds for randomized and quantum local search
 In Proc. ACM STOC
, 2006
"... Local Search problem, which finds a local minimum of a blackbox function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexity theory and many other areas in theoretical computer science. In this paper, we study the problem in both the randomize ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Local Search problem, which finds a local minimum of a blackbox function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexity theory and many other areas in theoretical computer science. In this paper, we study the problem in both
A LOCAL SEARCH ALGORITHM FOR BINARY MAXIMUM 2PATH PARTITIONING
"... Abstract. Let G be a complete (undirected) graph with 3l vertices. Given a binary weight function on the edges of G, the binary maximum 2path partitioning problem is to compute a set of of l vertexdisjoint simple 2edge paths with maximum total edge weight. The problem is NPhard [6]. In this pape ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
]. In this paper we propose a simple local search algorithm with polynomial running time for the problem and analyze its performance for several search depths. For depth 2, we show that the algorithm is a 0.3333approximation, and that the bound is tight. For depth 3, we show that the algorithm is a 0
Cardinality matching: Heuristic search for augmenting paths
, 1995
"... A new heuristic for the cardinality matching problem is given and compared with different greedy heuristics. A modified depth first search is used to search heuristically for an augmenting path with respect to a given matching. In a large number of testruns on randomly generated graphs, our heurist ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A new heuristic for the cardinality matching problem is given and compared with different greedy heuristics. A modified depth first search is used to search heuristically for an augmenting path with respect to a given matching. In a large number of testruns on randomly generated graphs, our
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
longstanding relationships with (Corwin and Schultz (2005)). In the same spirit, networks feature prominently in the venture capital industry. VCs tend to syndicate their investments with other VCs, rather than investing alone (Lerner (1994a)). They are thus bound by their current and past investments
Beyond Universality in Random Matrix Theory
, 2014
"... In order to have a better understanding of finite random matrices with nonGaussian entries, we study the 1/N expansion of local eigenvalue statistics in both the bulk and at the hard edge of the spectrum of random matrices. This gives valuable information about the smallest singular value not seen ..."
Abstract
 Add to MetaCart
In order to have a better understanding of finite random matrices with nonGaussian entries, we study the 1/N expansion of local eigenvalue statistics in both the bulk and at the hard edge of the spectrum of random matrices. This gives valuable information about the smallest singular value not seen
A simple and linear time randomized algorithm for computing sparse . . .
"... Let G = (V, E) be an undirected weighted graph on V  = n vertices, and E  = m edges. A tspanner of the graph G, for any t ≥ 1, is a subgraph (V, ES), ES ⊆ E, such that the distance between any pair of vertices in the subgraph is at most t times the distance between them in the graph G. Comput ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
the previously existing algorithms employ computation of some sort of local or global distance information which involves growing either breadth first search trees up to θ(t)levels or full shortest path trees on a large fraction of vertices. The truly local approach of our algorithm also leads to equally simple
Automatic program repair with evolutionary computation,”
 Commun. ACM,
, 2010
"... Abstract There are many methods for detecting and mitigating software errors but few generic methods for automatically repairing errors once they are discovered. This paper highlights recent work combining program analysis methods with evolutionary computation to automatically repair bugs in offth ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
characteristics, either of the program or the particular bug, determine how easily a solution can be found through random trial and error. However, thus far GP outperforms the other two search strategies in cases where the weighted path is long (i.e., where the fault is difficult to localize). There are several
Results 1  10
of
270