5580 search results - page 239 / 1116 » Randomized priority algorithms |
181
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
178
click to vote
CSCLP
2005
Springer
15 years 11 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
162
click to vote
CP
2000
Springer
15 years 9 months ago
2000
Springer
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...
229
click to vote
FPGA
2008
ACM
15 years 7 months ago
2008
ACM
Stochastic simulations and other scientific applications that depend on random numbers are increasingly implemented in a parallelized manner in programmable logic. High-quality ps...
147
click to vote
IJCAI
1997
15 years 7 months ago
1997
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...