1046 search results - page 85 / 210 » Approximation Algorithms for Domination Search |
111
Voted
CP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
133
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
123
click to vote
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
93
Voted
STOC
2005
ACM
16 years 26 days ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
77
Voted
IJCAI
1997
15 years 1 months ago
1997
The AI literature contains many definitions of diagnostic reasoning most of which are defined in terms of the logical entailment relation. We use existing work on approximate en...