1139 search results - page 221 / 228 » Bounded Ideation Theory |
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...