Sciweavers

2703 search results - page 421 / 541
» Working Class Hero
Sort
View
JCSS
2011
95views more  JCSS 2011»
13 years 5 months ago
Hardness results for approximating the bandwidth
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
Chandan K. Dubey, Uriel Feige, Walter Unger
JDA
2011
90views more  JDA 2011»
13 years 5 months ago
Pattern matching in pseudo real-time
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
Raphaël Clifford, Benjamin Sach
SIAMCO
2011
13 years 5 months ago
Asymptotically Optimal Controls for Time-Inhomogeneous Networks
Abstract. A framework is introduced for the identification of controls for single-class timevarying queueing networks that are asymptotically optimal in the so-called uniform acce...
Milica Cudina, Kavita Ramanan
VLC
2011
83views more  VLC 2011»
13 years 5 months ago
A decision procedure for a decidable fragment of generalized constraint diagrams
Constraint diagrams were introduced by Kent, in 1997, as an alternative to the OCL for placing formal constraints on software models. Since their introduction, constraint diagrams...
Jim Burton, Gem Stapleton, Ali Hamie
HOTNETS
2010
13 years 5 months ago
Automatic rate adaptation
Rate adaptation is a fundamental primitive in wireless networks. Since wireless channel strength varies quickly and unpredictably, senders have to constantly measure the channel a...
Aditya Gudipati, Sachin Katti