2957 search results - page 244 / 592 » The Complexity of Polynomial-Time Approximation |
148
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...
159
click to vote
ATAL
2003
Springer
15 years 12 months ago
2003
Springer
In a large distributed system it is often infeasible or even impossible to perform diagnosis using a single model of the whole system. Instead, several spatially distributed local...
200
click to vote
CRYPTO
2003
Springer
15 years 12 months ago
2003
Springer
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
178
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
252
click to vote
CCA
2009
Springer
15 years 11 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...