Results 1  10
of
231,403
Depthfirst IterativeDeepening: An Optimal Admissible Tree Search
 Artificial Intelligence
, 1985
"... The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadthfirst search requires too much space and depthfirst search can use too much time and doesn't always find a cheapest path. A depthfirst iteratiwdeepening a ..."
Abstract

Cited by 523 (24 self)
 Add to MetaCart
deepening algorithm is shown to be asymptotically optimal along all three dimensions for exponential pee searches. The algorithm has been used successfully in chess programs, has been eflectiuely combined with bidirectional search, and has been applied to bestfirst heuristic search as well. This heuristic depth
Balanced Allocations
 SIAM Journal on Computing
, 1994
"... Suppose that we sequentially place n balls into n boxes by putting each ball into a randomly chosen box. It is well known that when we are done, the fullest box has with high probability (1 + o(1)) ln n/ ln ln n balls in it. Suppose instead that for each ball we choose two boxes at random and place ..."
Abstract

Cited by 325 (8 self)
 Add to MetaCart
the ball into the one which is less full at the time of placement. We show that with high probability, the fullest box contains only ln ln n/ ln 2 +O(1) balls  exponentially less than before. Furthermore, we show that a similar gap exists in the infinite process, where at each step one ball, chosen
Exponential
, 2010
"... www.esdat.net Esdat Environmental Database Management Software +61 2 8875 7948 To facilitate understanding of the various units used in laboratory reports, the following conversion table is provided: ..."
Abstract
 Add to MetaCart
www.esdat.net Esdat Environmental Database Management Software +61 2 8875 7948 To facilitate understanding of the various units used in laboratory reports, the following conversion table is provided:
Galaxy: A platform for interactive largescale genome analysis
 Genome Res
, 2005
"... Accessing and analyzing the exponentially expanding genomic sequence and functional data pose a challenge for biomedical researchers. Here we describe an interactive system, Galaxy, that combines the power of existing genome annotation databases with a simple Web portal to enable users to search rem ..."
Abstract

Cited by 233 (17 self)
 Add to MetaCart
Accessing and analyzing the exponentially expanding genomic sequence and functional data pose a challenge for biomedical researchers. Here we describe an interactive system, Galaxy, that combines the power of existing genome annotation databases with a simple Web portal to enable users to search
Dynamic Branch Prediction with Perceptrons
"... This paper presents a new method for branch prediction. The key idea is to use one of the simplest possible neural networks, the perceptron, as an alternative to the commonly used twobit counters. Our predictor achieves increased accuracy by making use of long branch histories, which are possible b ..."
Abstract

Cited by 164 (20 self)
 Add to MetaCart
because the hardware resources for our method scale linearly with the history length. By contrast, other purely dynamic schemes require exponential resources. We describe our design and evaluate it with respect to two well known predictors. We show that for a 4K byte hardware budget our method improves
Short Proofs are Narrow  Resolution made Simple
 Journal of the ACM
, 2000
"... The width of a Resolution proof is de ned to be the maximal number of literals in any clause of the proof. In this paper we relate proof width to proof length (=size), in both general Resolution, and its treelike variant. The following consequences of these relations reveal width as a crucial " ..."
Abstract

Cited by 205 (14 self)
 Add to MetaCart
"resource" of Resolution proofs. In one direction, the relations allow us to give simple, unified proofs for almost all known exponential lower bounds on size of resolution proofs, as well as several interesting new ones. They all follow from width lower bounds, and we show how these follow
Complexity Measures and Decision Tree Complexity: A Survey
 Theoretical Computer Science
, 2000
"... We discuss several complexity measures for Boolean functions: certificate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. We survey the relations and biggest gaps known between these measures, and show how they give bounds for the decision tr ..."
Abstract

Cited by 197 (17 self)
 Add to MetaCart
. For example, given a computational problem it tries to establish tight upper and lower bounds on the length of the computation (or on other resources, like space). Unfortunately, for many, practically relevant, computational problems no tight bounds are known. An illustrative example is the well known P
Text Segmentation Using Exponential Models
 In Proceedings of the Second Conference on Empirical Methods in Natural Language Processing
, 1997
"... This paper introduces a new statistical approach to partitioning text automatically into coherent segments. Our approach enlists both shortrange and longrange language models to help it sniff out likely sites of topic changes in text. To aid its search, the system consults a set of simple le ..."
Abstract

Cited by 65 (0 self)
 Add to MetaCart
This paper introduces a new statistical approach to partitioning text automatically into coherent segments. Our approach enlists both shortrange and longrange language models to help it sniff out likely sites of topic changes in text. To aid its search, the system consults a set of simple lexical hints it has learned to associate with the presence of boundaries through inspection of a large corpus of annotated data. We also propose a new probabilistically motivated ' error metric for use by the natural language processing and information retrieval communities, intended to supersede precision and recall for appraising segmentation algorithms. Qualitative assessment of our algorithm as well as evaluation using this new metric demonstrate the effective ness of our approach in two very different domains, Wall Street Journal articles and the TDT Corpus, a collection of newswire articles and broadcast news transcripts.
Results 1  10
of
231,403