438 search results - page 28 / 88 » New Search Heuristics for Max-CSP |
126
click to vote
BMCBI
2011
14 years 1 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
ANOR
2011
14 years 4 months ago
2011
A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentialit...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
CPAIOR
2005
Springer
15 years 3 months ago
2005
Springer
The effects of combining search and modelling techniques can be complex and unpredictable, so guidelines are very important for the design and development of effective and robust s...
EOR
2007
14 years 9 months ago
2007
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...