408 search results - page 64 / 82 » A lookahead strategy for solving large planning problems |
RAS
2008
14 years 8 months ago
2008
This work is about solving the global localization issue for mobile robots operating in large and cooperative environments. It tackles the problem of estimating the pose of a robo...
Publication
In this paper we describe a new class of representations for realvalued parameters called Center of Mass Encoding (CoME). CoME is based on variable length strings, it is self-adap...
PPOPP
2005
ACM
15 years 3 months ago
2005
ACM
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...
CONSTRAINTS
2007
14 years 9 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...