Sciweavers

2944 search results - page 34 / 589
» Improving Bound Propagation
Sort
View
SIROCCO
2004
13 years 9 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
Stefan Dobrev, Paola Flocchini, Nicola Santoro
ISVLSI
2007
IEEE
131views VLSI» more  ISVLSI 2007»
14 years 1 months ago
Improving the Quality of Bounded Model Checking by Means of Coverage Estimation
Formal verification has become an important step in circuit and system design. A prominent technique is Bounded Model Checking (BMC) which is widely used in industry. In BMC it i...
Ulrich Kühne, Daniel Große, Rolf Drechs...
JCSS
2008
80views more  JCSS 2008»
13 years 7 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
14 years 1 months ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount
ICC
2000
IEEE
111views Communications» more  ICC 2000»
13 years 12 months ago
Improving Bandwidth Utilization Based on Deterministic Delay Bound in Connection-Oriented Networks
Abstract—Packet scheduling disciplines play an important role in providing Quality of Service (QoS) guarantees to applications traffic in high speed networks. Several scheduling...
Peerapon Siripongwutikorn, Sujata Banerjee