Results 251 to 260 of about 9,166,026 (293)
An automaton Constraint for Local Search [PDF]
Fundamenta Informaticae, 2011 We explore the idea of using automata to implement new constraints for local search. This is already a successful approach in constraint-based global search. We show how to maintain the violations of a constraint and its variables via a deterministic finite automaton that describes a ground checker for that constraint. We extend the approach to counter
Jun He 0001 +2 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2010 Fourth International Conference on Digital Society, 2010
Vertical search engines enable users to find information related to a certain topic. A local search engine is a vertical search engine whose topic revolves around a certain geographical area (such as a city, state, country, etc…) In this paper we describe our experiences developing a crawler for a local search engine for the city of Bellingham ...
Pedro Huitema, Perry Fizzano
openaire +2 more sources
Vertical search engines enable users to find information related to a certain topic. A local search engine is a vertical search engine whose topic revolves around a certain geographical area (such as a city, state, country, etc…) In this paper we describe our experiences developing a crawler for a local search engine for the city of Bellingham ...
Pedro Huitema, Perry Fizzano
openaire +2 more sources
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2009
Many popular online services provide "local" or "yellow-pages" search, but none of them allow users to customize the search over user-specified data. This paper describes a novel system for providing custom local search over user-provided spatial datasets logically combined with detailed street-level vector data.
Naren Datha +3 more
openaire +1 more source
Many popular online services provide "local" or "yellow-pages" search, but none of them allow users to customize the search over user-specified data. This paper describes a novel system for providing custom local search over user-provided spatial datasets logically combined with detailed street-level vector data.
Naren Datha +3 more
openaire +1 more source
2017
Local search is a widely used method to solve combinatorial optimization problems. As many relevant combinatorial optimization problems are NP-hard, we often may not expect to find an algorithm that is guaranteed to return an optimal solution in a reasonable amount of time, i.e., in polynomial time.
Michiels, W., Aarts, E.H.L., Korst, Jan
openaire +1 more source
Local search is a widely used method to solve combinatorial optimization problems. As many relevant combinatorial optimization problems are NP-hard, we often may not expect to find an algorithm that is guaranteed to return an optimal solution in a reasonable amount of time, i.e., in polynomial time.
Michiels, W., Aarts, E.H.L., Korst, Jan
openaire +1 more source
Local-search Extraction of MUSes
Constraints, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gregoire, Eric +2 more
openaire +4 more sources
LOCAL++: a C++ framework for local search algorithms
Proceedings Technology of Object-Oriented Languages and Systems. TOOLS 29 (Cat. No.PR00275), 2000We present LOCAL++, an object-oriented framework to be used as a general tool for the development and the implementation of local search algorithms in C++. The framework comprises a hierarchy of abstract template classes, one for each local search technique taken into account (i.e., hill-climbing, simulated annealing, and tabu search).
Andrea Schaerf +2 more
openaire +4 more sources
2006
The Local Search algorithm is one of the simplest heuristic algothms for solving the MAX-SAT problem. The goal of this paper is to estimate the relative error produced by this algorithm being applied to random 3-CNFs with fixed density $\varrho$. We prove that, for any $\varrho$, there is a constant c such that a weakened version of Local Search that ...
Andrei A. Bulatov, Evgeny S. Skvortsov
openaire +1 more source
The Local Search algorithm is one of the simplest heuristic algothms for solving the MAX-SAT problem. The goal of this paper is to estimate the relative error produced by this algorithm being applied to random 3-CNFs with fixed density $\varrho$. We prove that, for any $\varrho$, there is a constant c such that a weakened version of Local Search that ...
Andrei A. Bulatov, Evgeny S. Skvortsov
openaire +1 more source
Control Abstractions for Local Search
Constraints, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pascal Van Hentenryck, Laurent Michel
openaire +2 more sources
2003
This paper presents Tree Local Search (TLS), a generic algorithm that hybridizes tree and local search methods. It has the following properties : it can filter all its instantiations and allows to freely select the variable whose value changes in case of failure.
openaire +1 more source
This paper presents Tree Local Search (TLS), a generic algorithm that hybridizes tree and local search methods. It has the following properties : it can filter all its instantiations and allows to freely select the variable whose value changes in case of failure.
openaire +1 more source