3533 search results - page 139 / 707 » Locally Optimized RANSAC |
161
click to vote
EVOW
2007
Springer
16 years 18 days ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
137
click to vote
SAT
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G2 WSAT deterministically ...
173
click to vote
DCOSS
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
155
click to vote
AI
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
225
click to vote
CRYPTO
2003
Springer
15 years 11 months ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...