Sciweavers

2944 search results - page 373 / 589
» Improving Bound Propagation
Sort
View
JAIR
1998
92views more  JAIR 1998»
15 years 6 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
MLQ
1998
84views more  MLQ 1998»
15 years 6 months ago
Arithmetical Measure
We develop arithmetical measure theory along the lines of Lutz [10]. This yields the same notion of “measure 0 set” as considered before by Martin-L¨of, Schnorr, and others. W...
Sebastiaan Terwijn, Leen Torenvliet
TON
1998
77views more  TON 1998»
15 years 6 months ago
Time-shift scheduling - fair scheduling of flows in high-speed networks
—We present a scheduling protocol, called time-shift scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a predet...
Jorge Arturo Cobb, Mohamed G. Gouda, Amal El-Nahas
TVLSI
1998
124views more  TVLSI 1998»
15 years 6 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl
TCOM
2010
115views more  TCOM 2010»
15 years 5 months ago
On the accuracy of localization systems using wideband antenna arrays
—Accurate positional information is essential for many applications in wireless networks. Time-of-arrival (TOA) and angle-of-arrival (AOA) are the two most commonly used signal m...
Yuan Shen, Moe Z. Win