601 search results - page 61 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
AAAI
1997
15 years 2 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
125
click to vote
DBSEC
2009
15 years 2 months ago
2009
Existing approaches for protecting sensitive information stored (outsourced) at external "honest-but-curious" servers are typically based on an overlying layer of encrypt...
112
click to vote
CPAIOR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
SAT
2004
Springer
15 years 7 months ago
2004
Springer
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
104
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...