Sciweavers

2834 search results - page 537 / 567
» Representing Trees with Constraints
Sort
View
PAMI
2008
152views more  PAMI 2008»
13 years 7 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
ORDER
2006
97views more  ORDER 2006»
13 years 7 months ago
Upward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
Vida Dujmovic, David R. Wood
KER
2007
90views more  KER 2007»
13 years 7 months ago
PLTOOL: A knowledge engineering tool for planning and learning
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
Susana Fernández, Daniel Borrajo, Raquel Fu...
AI
2002
Springer
13 years 7 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
CC
2002
Springer
131views System Software» more  CC 2002»
13 years 7 months ago
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
Abstract. This paper describes the C Intermediate Language: a highlevel representation along with a set of tools that permit easy analysis and source-to-source transformation of C ...
George C. Necula, Scott McPeak, Shree Prakash Rahu...