506 search results - page 63 / 102 » Automated Search for Heuristic Functions |
114
click to vote
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...
138
click to vote
GECCO
2007
Springer
15 years 9 months 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...
142
Voted
IWCMC
2006
ACM
15 years 9 months ago
2006
ACM
This paper presents a neural network model for routing in the space segment of a Satellite Personal Communication System. At first, a proper energy function is constructed from th...
107
Voted
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
136
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
We present a novel approach to multiagent planning for self-interested agents. The main idea behind our approach is that multiagent planning systems should be built upon (single-a...