8016 search results - page 1168 / 1604 » On the practical genetic algorithms |
235
Voted
ENTCS
2006
15 years 6 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
164
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— A rateless code—i.e., a rate-compatible family of codes—has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect fa...
185
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
177
Voted
JMLR
2008
15 years 6 months ago
2008
Support vector machine (SVM) is one of the most popular and promising classification algorithms. After a classification rule is constructed via the SVM, it is essential to evaluat...
189
click to vote
JPDC
2008
15 years 6 months ago
2008
By splitting a large broadcast message into segments and broadcasting the segments in a pipelined fashion, pipelined broadcast can achieve high performance in many systems. In thi...