Sciweavers

8 search results - page 1 / 2
» Inferring Variable Conflicts for Local Search
Sort
View
CP
2006
Springer
13 years 11 months ago
Inferring Variable Conflicts for Local Search
Abstract. For efficiency reasons, neighbourhoods in local search are often shrunk by only considering moves modifying variables that actually contribute to the overall penalty. The...
Magnus Ågren, Pierre Flener, Justin Pearson
IJCAI
1989
13 years 8 months ago
A Probabilistic Approach to Marker Propagation
Potentially, the advantages of marker-passing over local connectionist techniques for associa­ tive inference are (1) the ability to differen­ tiate variable bindings, and (2) r...
Dekai Wu
CVPR
2012
IEEE
11 years 10 months ago
Top-down visual saliency via joint CRF and dictionary learning
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...
Jimei Yang, Ming-Hsuan Yang
AAAI
2006
13 years 9 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
AIR
2004
130views more  AIR 2004»
13 years 7 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...