20294 search results - page 452 / 4059 » Algorithmic Information Theory |
195
click to vote
FAW
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
233
click to vote
GECCO
2007
Springer
16 years 1 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...
264
click to vote
PODC
2012
ACM
13 years 10 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
174
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
189
click to vote
ESA
2010
Springer
15 years 8 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...