920 search results - page 112 / 184 » Generating Satisfiable Problem Instances |
EUROGP
2007
Springer
15 years 6 months ago
2007
Springer
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
105
Voted
SPIRE
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
190
Voted
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
In some applications of privacy preserving data publishing, a practical demand is to publish a data set on multiple quasi-identifiers for multiple users simultaneously, which poses...
99
Voted
SAT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
115
Voted
ETFA
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, the effect of network-induced delay introduced into the control loop is modelled as time-varying disturbance. Based on this model, a fault isolation filter (FIF) f...