Sciweavers

828 search results - page 25 / 166
» Bounded Hairpin Completion
Sort
View
DAM
1999
132views more  DAM 1999»
13 years 7 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
SLIP
2009
ACM
14 years 2 months ago
On the bound of time-domain power supply noise based on frequency-domain target impedance
One of the popular design methodologies for power distribution networks (PDNs) is to identify a target impedance to be met across a broad frequency range. The methodology is based...
Xiang Hu, Wenbo Zhao, Peng Du, Yulei Zhang, Amiral...
AAAI
2000
13 years 9 months ago
Depth-First Branch-and-Bound versus Local Search: A Case Study
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
Weixiong Zhang
CGF
1998
118views more  CGF 1998»
13 years 7 months ago
An Exhaustive Error-Bounding Algorithm for Hierarchical Radiosity
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial appli...
Nicolas Holzschuch, François X. Sillion
IPPS
2010
IEEE
13 years 5 months ago
Broadcasting on large scale heterogeneous platforms under the bounded multi-port model
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
Olivier Beaumont, Lionel Eyraud-Dubois, Shailesh K...