1921 search results - page 119 / 385 » Making AC-3 an Optimal Algorithm |
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
GECCO
2010
Springer
14 years 3 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 ...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
CCS
2008
ACM
14 years 4 days ago
2008
ACM
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
STOC
1994
ACM
14 years 2 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...