4403 search results - page 114 / 881 » Galois Theory of Algorithms |
161
click to vote
GECCO
2009
Springer
16 years 26 days ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
155
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
153
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
152
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
198
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...