9842 search results - page 1372 / 1969 » Problem complexity |
180
Voted
GECCO
2005
Springer
16 years 24 days ago
2005
Springer
Genetic Algorithms (GAs) are a search and optimization technique based on the mechanism of evolution. Recently, another sort of population-based optimization method called Estimat...
235
click to vote
SIGECOM
2003
ACM
16 years 16 days ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
246
click to vote
SPAA
2010
ACM
16 years 3 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
246
click to vote
PODC
2010
ACM
15 years 11 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
201
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...