6693 search results - page 993 / 1339 » On an anytime algorithm for control |
215
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
158
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper extends previous work showing how fluctuating crosstalk in a deterministic fitness function introduces noise into genetic algorithms. In that work, we modeled fluctuati...
180
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
158
click to vote
VVS
2000
IEEE
15 years 10 months ago
2000
IEEE
Multi-resolution data-structures and algorithms are key in Visualization to achieve real-time interaction with large data-sets. Research has been primarily focused on the off-line...
161
click to vote
WDAG
2000
Springer
15 years 10 months ago
2000
Springer
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...