58 search results - page 4 / 12 » Probabilistically Survivable MASs |
TSP
2008
13 years 7 months ago
2008
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
ISCA
2008
IEEE
14 years 1 months ago
2008
IEEE
Writing shared-memory parallel programs is error-prone. Among the concurrency errors that programmers often face are atomicity violations, which are especially challenging. They h...
KCAP
2003
ACM
14 years 19 days ago
2003
ACM
Acquiring knowledge has long been the major bottleneck preventing the rapid spread of AI systems. Manual approaches are slow and costly. Machine-learning approaches have limitatio...
COLCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
We do a case study of two different analysis techniques for studying the stochastic behavior of a randomized system/algorithms: (i) The first approach can be broadly termed as a ...
HAIS
2008
Springer
13 years 8 months ago
2008
Springer
For systematic analyses of quantitative mass spectrometry data a method was developed in order to reveal peptides within a protein, that show differences in comparison with the rem...