4894 search results - page 638 / 979 » Dynamic Abstraction Planning |
165
click to vote
TCS
1998
15 years 6 months ago
1998
Abstract. We show that Turyn’s conjecture, arising from the Theory of Error Correcting Codes, has an equivalent formulation in Dynamical Systems Theory. In particular, Turyn’s ...
233
click to vote
TEC
2002
15 years 6 months ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
169
click to vote
TECS
2002
15 years 6 months ago
2002
les to further raise the abstraction level of the initial specification, where dynamic data sets can be specified without low-level details. Our method is suited for hardware and s...
188
click to vote
TROB
2002
15 years 6 months ago
2002
Abstract--The key to utilizing the potential of multirobot systems is cooperation. How can we achieve cooperation in systems composed of failure-prone autonomous robots operating i...
164
click to vote
TSMC
2002
15 years 6 months ago
2002
Abstract--Most genetic algorithm (GA) users adjust the main parameters of the design of a GA (crossover and mutation probability, population size, number of generations, crossover,...