4451 search results - page 346 / 891 » On Random Ordering Constraints |
189
click to vote
IJCAI
2001
15 years 8 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
144
click to vote
AAAI
1998
15 years 8 months ago
1998
We present a noisy-OR Bayesian network model for simulation-based training, and an efficient search-based algorithm for automatic synthesis of plausible training scenarios from co...
181
click to vote
TIP
2008
15 years 6 months ago
2008
Abstract--In this paper, we propose a maximum-entropy expectation-maximization (MEEM) algorithm. We use the proposed algorithm for density estimation. The maximum-entropy constrain...
221
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Global shape information is an effective top-down complement
to bottom-up figure-ground segmentation as well
as a useful constraint to avoid drift during adaptive tracking.
We p...
212
click to vote
HIPEAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Stream programming is a promising way to expose concurrency to the compiler. A stream program is built from kernels that communicate only via point-to-point streams. The ...