Sciweavers

1040 search results - page 183 / 208
» Rounding algorithms for covering problems
Sort
View
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
15 years 1 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
ECCB
2008
IEEE
14 years 11 months ago
Towards de novo identification of metabolites by analyzing tandem mass spectra
Abstract. Mass spectrometry is among the most widely used technologies in proteomics and metabolomics. For metabolites, de novo interpretation of spectra is even more important tha...
Sebastian Böcker, Florian Rasche
JSAC
2006
183views more  JSAC 2006»
14 years 9 months ago
HiRLoc: high-resolution robust localization for wireless sensor networks
In this paper we address the problem of robustly estimating the position of randomly deployed nodes of a Wireless Sensor Network (WSN), in the presence of security threats. We prop...
Loukas Lazos, Radha Poovendran
SOCA
2008
IEEE
14 years 9 months ago
Log-based mining techniques applied to Web service composition reengineering
There is no doubt that SOA and BPM will continue to evolve dependently for the next ten years. Preparing common research infrastructures will require most important efforts of web ...
Walid Gaaloul, Karim Baïna, Claude Godart
EC
2000
241views ECommerce» more  EC 2000»
14 years 9 months ago
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
To successfully apply evolutionary algorithms to the solution of increasingly complex problems, we must develop effective techniques for evolving solutions in the form of interact...
Mitchell A. Potter, Kenneth A. De Jong