1434 search results - page 102 / 287 » Graph Searching with Advice |
JAIR
2006
13 years 8 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
IAT
2009
IEEE
14 years 3 months ago
2009
IEEE
—We present the STORIES methods and tool for (a) an abstracted story representation from a collection of time-indexed documents; (b) visualising it in a way that encourages users...
CCCG
2001
13 years 10 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
GECCO
2010
Springer
14 years 26 days ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...