Sciweavers

973 search results - page 173 / 195
» New Bounds on Crossing Numbers
Sort
View
EOR
2007
104views more  EOR 2007»
13 years 8 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 3 months ago
MDS Array Codes with Optimal Rebuilding
—MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the the fr...
Itzhak Tamo, Zhiying Wang, Jehoshua Bruck
ECCC
2010
143views more  ECCC 2010»
13 years 5 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 3 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert