Results 261 to 270 of about 794,304 (306)
Some of the next articles are maybe not open access.
Local search algorithm to improve the local search
14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings., 2003In this paper, we present a new cooperative framework based on using successively two local search algorithms to solve constraint satisfaction and optimization problems. Our technique is based on the integration of local search algorithms as a mechanism to diversify the search instead of using a build on diversification mechanisms. Thus we avoid tuning
Mohamed Tounsi 0002, Philippe David
openaire +1 more source
Localizer A modeling language for local search
INFORMS Journal on Computing, 1997Local search is a traditional technique to solve combinatorial search problems and has raised much interest in recent years. The design and implementation of local search algorithms is not an easy task in general and may require considerable experimentation and programming effort.
Laurent D. Michel, Pascal Van Hentenryck
openaire +1 more source
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
We introduce CLS, for continuous local search, a class of polynomial-time checkable total functions that lies at the intersection of PPAD and PLS, and captures a particularly benign kind of local optimization in which the domain is continuous, as opposed to combinatorial, and the functions involved are continuous.
Daskalakis, Constantinos +1 more
openaire +1 more source
We introduce CLS, for continuous local search, a class of polynomial-time checkable total functions that lies at the intersection of PPAD and PLS, and captures a particularly benign kind of local optimization in which the domain is continuous, as opposed to combinatorial, and the functions involved are continuous.
Daskalakis, Constantinos +1 more
openaire +1 more source
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 +1 more source
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 +1 more source
IEEE Internet Computing, 2002
Local searching tools search Web pages that are on or close to a Web site in order to answer specific queries. A Web query taxonomy based on WebSQL can help to enhance local searching techniques.
Michele Angelaccio, Berta Buttarazzi
openaire +1 more source
Local searching tools search Web pages that are on or close to a Web site in order to answer specific queries. A Web query taxonomy based on WebSQL can help to enhance local searching techniques.
Michele Angelaccio, Berta Buttarazzi
openaire +1 more source
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
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 +3 more sources