Sciweavers

78 search results - page 3 / 16
» Local Search Algorithms for Partial MAXSAT
Sort
View
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 1 months ago
Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
Silvia Acid, Luis M. de Campos
SPIN
2005
Springer
15 years 3 months ago
Improving Spin's Partial-Order Reduction for Breadth-First Search
We describe an improvement of the partial-order reduction algorithm for breadth-first search which was introduced in Spin version 4.0. Our improvement is based on the algorithm by...
Dragan Bosnacki, Gerard J. Holzmann
CVPR
2007
IEEE
15 years 12 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
ECAI
2010
Springer
14 years 8 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
PRICAI
2004
Springer
15 years 3 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...