Sciweavers

4266 search results - page 170 / 854
» The container loading problem
Sort
View
IPPS
2010
IEEE
15 years 1 months ago
Decentralized resource management for multi-core desktop grids
The majority of CPUs now sold contain multiple computing cores. However, current desktop grid computing systems either ignore the multiplicity of cores, or treat them as distinct,...
Jaehwan Lee, Peter J. Keleher, Alan Sussman
TELSYS
2010
147views more  TELSYS 2010»
14 years 10 months ago
A new worm propagation threat in BitTorrent: modeling and analysis
Peer-to-peer (p2p) networking technology has gained popularity as an efficient mechanism for users to obtain free services without the need for centralized servers. Protecting thes...
Sinan Hatahet, Abdelmadjid Bouabdallah, Yacine Cha...
FOCS
2007
IEEE
15 years 10 months ago
On the Advantage over Random for Maximum Acyclic Subgraph
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
Moses Charikar, Konstantin Makarychev, Yury Makary...
CCCG
2003
15 years 5 months ago
Decomposing Polygons Into Diameter Bounded Components
A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygon...
Chris Worman
COMBINATORICA
2008
87views more  COMBINATORICA 2008»
15 years 4 months ago
Quasi-randomness and the distribution of copies of a fixed graph
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
Asaf Shapira