Results 1 - 10
of
177,516
The FF planning system: Fast plan generation through heuristic search
- Journal of Artificial Intelligence Research
, 2001
"... We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be ind ..."
Abstract
-
Cited by 822 (53 self)
- Add to MetaCart
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts
Planning as Heuristic Search
- Artificial Intelligence
, 2001
"... In the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be competitive with state of the art Graphplan and sat planners. Heuristic search planners like hsp transform planning problems into problems of heuristic search by automatically extracting heuristics from S ..."
Abstract
-
Cited by 423 (34 self)
- Add to MetaCart
In the AIPS98 Planning Contest, the hsp planner showed that heuristic search planners can be competitive with state of the art Graphplan and sat planners. Heuristic search planners like hsp transform planning problems into problems of heuristic search by automatically extracting heuristics from
World-Championship-Caliber Scrabble
- ARTIFICIAL INTELLIGENCE
, 2002
"... Computer Scrabble programs have achieved a level of performance that exceeds that of the strongest human players. MAVEN was the first program to demonstrate this against human opposition. Scrabble is a game of imperfect information with a large branching factor. The techniques successfully applied i ..."
Abstract
-
Cited by 66 (0 self)
- Add to MetaCart
Computer Scrabble programs have achieved a level of performance that exceeds that of the strongest human players. MAVEN was the first program to demonstrate this against human opposition. Scrabble is a game of imperfect information with a large branching factor. The techniques successfully applied
Gapped Blast and PsiBlast: a new generation of protein database search programs
- NUCLEIC ACIDS RESEARCH
, 1997
"... The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and statistical refinements described here permits the execution time of the BLAST programs to be decreased substantially while ..."
Abstract
-
Cited by 8393 (85 self)
- Add to MetaCart
enhancing their sensitivity to weak similarities. A new criterion for triggering the extension of word hits, combined with a new heuristic for generating gapped alignments, yields a gapped BLAST program that runs at approximately three times the speed of the original. In addition, a method is introduced
The unbearable automaticity of being
- AMERICAN PSYCHOLOGIST
, 1999
"... What was noted by E. J. hanger (1978) remains true today: that much of contemporary psychological research is based on the assumption that people are consciously and systematically processing incoming information in order to construe and interpret their world and to plan and engage in courses of act ..."
Abstract
-
Cited by 568 (14 self)
- Add to MetaCart
What was noted by E. J. hanger (1978) remains true today: that much of contemporary psychological research is based on the assumption that people are consciously and systematically processing incoming information in order to construe and interpret their world and to plan and engage in courses of action. As did E. J. hanger, the authors question this assumption. First, they review evidence that the ability to exercise such conscious, intentional control is actually quite limited, so that most of moment-to-moment psychological life must occur through nonconscious means if it is to occur at all. The authors then describe the different possible mechanisms that produce automatic, environmental control over these various phenomena and review evidence establishing both the existence of these mechanisms as well as their consequences for judgments, emotions, and
A Trainable Document Summarizer
, 1995
"... To summarize is to reduce in complexity, and hence in length, while retaining some of the essential qualities of the original. This paper focusses on document extracts, a particular kind of computed document summary. ..."
Abstract
-
Cited by 525 (2 self)
- Add to MetaCart
To summarize is to reduce in complexity, and hence in length, while retaining some of the essential qualities of the original. This paper focusses on document extracts, a particular kind of computed document summary.
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- Artificial Intelligence
, 1995
"... The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments i ..."
Abstract
-
Cited by 1169 (11 self)
- Add to MetaCart
The purpose of this paper is to study the fundamental mechanism humans use in argumentation and its role in different major approaches to commonsense reasoning in AI and logic programming. We present three novel results: We develop a theory for argumentation in which the acceptability of arguments
Letizia: An agent that assists web browsing
- PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-95
, 1995
"... ..."
Texture Synthesis by Non-parametric Sampling
- In International Conference on Computer Vision
, 1999
"... A non-parametric method for texture synthesis is proposed. The texture synthesis process grows a new image outward from an initial seed, one pixel at a time. A Markov random field model is assumed, and the conditional distribution of a pixel given all its neighbors synthesized so far is estimated by ..."
Abstract
-
Cited by 1014 (7 self)
- Add to MetaCart
A non-parametric method for texture synthesis is proposed. The texture synthesis process grows a new image outward from an initial seed, one pixel at a time. A Markov random field model is assumed, and the conditional distribution of a pixel given all its neighbors synthesized so far is estimated by querying the sample image and finding all similar neighborhoods. The degree of randomness is controlled by a single perceptually intuitive parameter. The method aims at preserving as much local structure as possible and produces good results for a wide variety of synthetic and real-world textures. 1. Introduction Texture synthesis has been an active research topic in computer vision both as a way to verify texture analysis methods, as well as in its own right. Potential applications of a successful texture synthesis algorithm are broad, including occlusion fill-in, lossy image and video compression, foreground removal, etc. The problem of texture synthesis can be formulated as follows: let...
Results 1 - 10
of
177,516