Sciweavers

4066 search results - page 82 / 814
» Almost Complete Sets
Sort
View
DM
2002
101views more  DM 2002»
13 years 10 months ago
Pseudocomplements of closure operators on posets
Some recent results provide su cient conditions for complete lattices of closure operators on complete lattices, ordered pointwise, to be pseudocomplemented. This paper gives resu...
Francesco Ranzato
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 10 months ago
About the Lifespan of Peer to Peer Networks
In this paper we analyze the ability of peer to peer networks to deliver a complete file among the peers. Early on we motivate a broad generalization of network behavior organizing...
Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, St&ea...
COCO
1998
Springer
95views Algorithms» more  COCO 1998»
14 years 2 months ago
Resource-Bounded Measure
We present a notion of resource-bounded measure for P and other subexponential-time classes. This generalization is based on Lutz's notion of measure, but overcomes the limit...
Jack H. Lutz
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
14 years 2 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
DM
1998
54views more  DM 1998»
13 years 9 months ago
On the structure of a random sum-free set of positive integers
Cameron introduced a natural probability measure on the set S of sum-free sets, and asked which sets of sum-free sets have a positive probability of occurring in this probability m...
Neil J. Calkin