Results 1  10
of
423
Filtering MultipleRecord Web Documents Based on Application Ontologies
, 2000
"... Hand filtering of a large set of documents, such as a list of searchenginereturned Web pages, is extremely tedious. As a step toward solving this problem, we propose an automated technique for filtering multiplerecord Web documents. Our approach is databasecentric, being based on conceptualm ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
that appears to apply to an application ontology, (2) an expectedvalue heuristic that compares the number of values found for each attribute in a document to the number expected by the application ontology, and (3) a grouping heuristic that considers whether the potential attributevalue pairs
Recognizing ontologyapplicable multiplerecord Web documents
 In Proceedings of the 20th International Conference on Conceptual Modeling (ER2001
, 2001
"... Automatically recognizing which Web documents are “of interest ” for some specified application is nontrivial. As a step toward solving this problem, we propose a technique for recognizing which multiplerecord Web documents apply to an ontologically specified application. Given the values and kind ..."
Abstract

Cited by 16 (9 self)
 Add to MetaCart
and kinds of values recognized by an ontological specification in an unstructured Web document, we apply three heuristics: (1) a density heuristic that measures the percent of the document that appears to apply to an application ontology, (2) an expectedvalue heuristic that compares the number and kind
Reasoning about beliefs and actions under computational resource constraints
 in Proceedings of the 1989 Workshop on Uncertainty and AI
, 1987
"... Although many investigators arm a desire to build reasoning systems that behave consistently with the axiomatic basis dened by probability theory and utility theory, limited resources for engineering and computation can make a complete normative analysis impossible. We attempt to move discussion be ..."
Abstract

Cited by 219 (22 self)
 Add to MetaCart
alternative approximation procedures and heuristics for computation and knowledge acquisition. We discuss how knowledge about the structure of user utility can be used to control value tradeos for tailoring inference to alternative contexts. We address the notion of realtime rationality, focusing
Bidirectional Heuristic Search Reconsidered
 Journal of Artificial Intelligence Research
, 1997
"... The assessment of bidirectional heuristic search has been incorrect since it was first published more than a quarter of a century ago. For quite a long time, this search strategy did not achieve the expected results, and there was a major misunderstanding about the reasons behind it. Although there ..."
Abstract

Cited by 42 (3 self)
 Add to MetaCart
The assessment of bidirectional heuristic search has been incorrect since it was first published more than a quarter of a century ago. For quite a long time, this search strategy did not achieve the expected results, and there was a major misunderstanding about the reasons behind it. Although
Quantum amplitude amplification and estimation
, 2002
"... Abstract. Consider a Boolean function χ: X → {0, 1} that partitions set X between its good and bad elements, where x is good if χ(x) = 1 and bad otherwise. Consider also a quantum algorithm A such that A0 〉 = � x∈X αxx 〉 is a quantum superposition of the elements of X, and let a denote the proba ..."
Abstract

Cited by 174 (14 self)
 Add to MetaCart
show that this quadratic speedup can also be obtained for a large family of search problems for which good classical heuristics exist. Finally, as our main result, we combine ideas from Grover’s and Shor’s quantum algorithms to perform amplitude estimation, a process that allows to estimate the value
Finding Optimal Solutions to Rubik's Cube Using Pattern Databases
, 1997
"... We have found the first optimal solutions to random instances of Rubik's Cube. The median optimal solution length appears to be 18 moves. The algorithm used is iterativedeepeningA* (IDA*), with a lowerbound heuristic function based on large memorybased lookup tables, or "pattern databas ..."
Abstract

Cited by 158 (8 self)
 Add to MetaCart
;pattern databases" (Culberson and Schaeffer 1996). These tables store the exact numberofmoves required to solve various subgoals of the problem, in this case subsets of the individual movable cubies. We characterize the effectiveness of an admissible heuristic function by its expected value, and hypothesize
Heuristic approach to the Schwarzschild geometry
, 2003
"... In this article I will present a simple Newtonian heuristic for “deriving” a weakfield approximation for the spacetime geometry of a point particle. The heuristic is based on Newtonian gravity, the notion of local inertial frames [the Einstein equivalence principle], plus the use of Galilean coor ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
coordinate transformations to connect the freely falling local inertial frames back to the “fixed stars”. Because of the heuristic and quasiNewtonian manner in which the spacetime geometry is obtained, we are only justified in expecting it to be a weakfield approximation to the true spacetime geometry
Computationally Efficient Scheduling with the Physical Interference Model for Throughput Improvement in Wireless Mesh Networks
 in Wireless Mesh Networks,” in Proc. ACM MobiCom
, 2006
"... Wireless mesh networks are expected to be widely used to provide Internet access in the near future. In order to fulfill the expectations, these networks should provide high throughput simultaneously to many users. Recent research has indicated that, due to its conservative CSMA/CA channel access sc ..."
Abstract

Cited by 140 (10 self)
 Add to MetaCart
Wireless mesh networks are expected to be widely used to provide Internet access in the near future. In order to fulfill the expectations, these networks should provide high throughput simultaneously to many users. Recent research has indicated that, due to its conservative CSMA/CA channel access
Policy Matrix Evolution for Generation of Heuristics
"... Online binpacking is a wellknown problem in which immediate decisions must be made about the placement of items with various sizes into fixed capacity bins. The associated decisions can be based on an index policy in which each decision option is independently given a value and the highest value c ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Online binpacking is a wellknown problem in which immediate decisions must be made about the placement of items with various sizes into fixed capacity bins. The associated decisions can be based on an index policy in which each decision option is independently given a value and the highest value
Pruning Improves Heuristic Search for CostSensitive Learning
 In Proceedings of the Nineteenth International Conference of Machine Learning
, 2002
"... This paper addresses costsensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to formulate this as a Markov Decision Process in which the transition model is learned from the training data. Specif ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
. Specifically, we assume a set of training examples in which all attributes (and the true class) have been measured. We describe a learning algorithm based on the AO # heuristic search procedure that searches for the classification policy with minimum expected cost. We provide an admissible heuristic
Results 1  10
of
423