114 search results - page 12 / 23 » Some Notes on Pseudo-closed Sets |
INFOCOM
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
JOOP
1998
13 years 7 months ago
1998
A set of rules to ascertain that in calls of the form x.f (...) there will always be an object attached to x. 1 PURPOSE The theory developed in this article investigates void call...
FAST
2009
13 years 5 months ago
2009
Some tasks in a dataspace (a loose collection of heterogeneous data sources) require integration of fine-grained data from diverse sources. This work is often done by end users kn...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...