3521 search results - page 503 / 705 » Algorithmic Control in Concurrent Computations |
137
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
We attack the problem of user fatigue by using an interactive genetic algorithm to evolve user interfaces in the XUL interface definition language. The interactive genetic algori...
125
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
136
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
139
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
136
click to vote
CCS
2006
ACM
15 years 7 months ago
2006
ACM
In-network aggregation is an essential primitive for performing queries on sensor network data. However, most aggregation algorithms assume that all intermediate nodes are trusted...