4066 search results - page 15 / 814 » Almost Complete Sets |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
MST
2010
13 years 6 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
IANDC
2010
13 years 6 months ago
2010
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well-known but commonly elided. In this paper we argue that any such concrete re...
COCO
1991
Springer
13 years 11 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...