244 search results - page 20 / 49 » On the Tightness of the Buhrman-Cleve-Wigderson Simulation |
JGAA
2006
14 years 11 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
QUESTA
2006
14 years 11 months ago
2006
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
ANOR
2005
14 years 11 months ago
2005
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
TIT
2008
14 years 11 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
101
click to vote
JFR
2007
14 years 11 months ago
2007
In this paper we describe an Extended Kalman Filter (EKF) algorithm for estimating the pose and velocity of a spacecraft during Entry, Descent and Landing (EDL). The proposed esti...