2313 search results - page 252 / 463 » On Heuristic Time Hierarchies |
196
click to vote
AI
2007
Springer
16 years 24 days ago
2007
Springer
In this paper, we present an approach for recovering a topological map of the environment using only detection events from a deployed sensor network. Unlike other solutions to this...
180
click to vote
COCOON
2007
Springer
16 years 23 days ago
2007
Springer
Given an RNA family characterized by conserved sequences and folding constraints, the problem is to search for all the instances of the RNA family in a genomic database. As seed-ba...
178
click to vote
EVOW
2007
Springer
16 years 23 days ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
189
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
150
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...