3495 search results - page 232 / 699 » On the random satisfiable process |
309
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
To preserve client privacy in the data mining process, a variety of techniques based on random perturbation of individual data records have been proposed recently. In this paper, ...
190
click to vote
RECOMB
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also cal...
205
click to vote
SLS
2009
Springer
16 years 1 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
194
click to vote
ACG
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
174
click to vote
DNA
2001
Springer
15 years 11 months ago
2001
Springer
In the universal DNA chip method, target RNAs are mapped onto a set of DNA tags. Parallel hybridization of these tags with an indexed, complementary antitag array then provides an ...