Sciweavers

2944 search results - page 579 / 589
» Improving Bound Propagation
Sort
View
EOR
2007
104views more  EOR 2007»
13 years 9 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
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
13 years 9 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
TCAD
2008
136views more  TCAD 2008»
13 years 9 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar
BMCBI
2005
122views more  BMCBI 2005»
13 years 9 months ago
Quantitative analysis of EGR proteins binding to DNA: assessing additivity in both the binding site and the protein
Background: Recognition codes for protein-DNA interactions typically assume that the interacting positions contribute additively to the binding energy. While this is known to not ...
Jiajian Liu, Gary D. Stormo
TON
2008
109views more  TON 2008»
13 years 9 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...