134 search results - page 9 / 27 » An Optimal Rebuilding Strategy for an Incremental Tree Probl... |
74
Voted
CPAIOR
2006
Springer
15 years 2 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
95
Voted
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
First, the covariance matrix adaptation (CMA) with rankone update is introduced into the (1+1)-evolution strategy. An improved implementation of the 1/5-th success rule is propose...
IROS
2009
IEEE
15 years 5 months ago
2009
IEEE
— In previous work we presented a multi-robot strategy for routing missions in large scenarios where network connectivity must be explicitly preserved. This strategy is founded o...
81
Voted
KDD
2006
ACM
15 years 11 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
79
Voted
AAAI
2006
15 years 10 days ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...