Sciweavers

475 search results - page 21 / 95
» Z3-Connectivity with Independent Number 2
Sort
View
SIAMJO
2008
175views more  SIAMJO 2008»
13 years 9 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin
SSS
2007
Springer
14 years 4 months ago
Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance
In this paper we present a rigorous treatment to structured overlay maintenance in decentralized peerto-peer (P2P) systems subject to various system and network failures. we prese...
Yu Chen, Wei Chen
DOCENG
2003
ACM
14 years 3 months ago
Two diet plans for fat PDF
As Adobe's Portable Document Format has exploded in popularity so too has the number PDF generators, and predictably the quality of generated PDF varies considerably. This pa...
Thomas A. Phelps, Robert Wilensky
RSA
2011
89views more  RSA 2011»
13 years 4 months ago
Excluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
József Balogh, Jane Butterfield
RSA
2008
94views more  RSA 2008»
13 years 9 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski