Filters








30,396 Hits in 5.9 sec

Local search: Is brute-force avoidable?

Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances Rosamond, Saket Saurabh, Yngve Villanger
2012 Journal of computer and system sciences (Print)  
We complement these fixed-parameter tractable algorithms for k-local search with parameterized intractability results indicating that brute-force search is unavoidable in more general classes of graphs  ...  However, for inputs of size n, a naïve brute-force search of the k-exchange neighborhood requires n O(k) time, which is not practical even for very small values of k.  ...  Is there a faster way of searching the k-exchange neighborhood than brute-force?  ... 
doi:10.1016/j.jcss.2011.10.003 fatcat:t5j76ca5yfc4zo6ljy5ovstquq

Local Search [chapter]

Marco A. Montes de Oca, Carlos Cotta, Ferrante Neri
2012 Studies in Computational Intelligence  
This combination of a population-based, global search and a single-solution local search is a very appealing one.  ...  The local search can be integrated within the evolutionary cycle mainly in two ways. The first is the so called "life-time learn-  ...  Such a restarting strategy is a simple way of endowing HC with global optimization capabilities, yet in some sense can be seen as a brute-force approach.  ... 
doi:10.1007/978-3-642-23247-3_3 fatcat:dzn4pr2l5jep3d5us7mabk5k6u

Exact algorithms via monotone local search

Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2016 Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016  
Our approach is based on "monotone local search", where the goal is to extend a partial solution to a solution by adding as few elements as possible.  ...  A typical example of a subset problem is Weighted d-SAT. Here, the input is a CNF-formula with clauses of size at most d, and an integer W .  ...  In the first case the local search problem can be solved in time d r · n O(1) . In the second case we do not know any better alternative to a brute-force search.  ... 
doi:10.1145/2897518.2897551 dblp:conf/stoc/FominGLS16 fatcat:owhsq6a7ibcdxkoz72u3he64lm

Exact Algorithms via Monotone Local Search [article]

Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh
2015 arXiv   pre-print
Our approach is based on "monotone local search", where the goal is to extend a partial solution to a solution by adding as few elements as possible.  ...  The task is to determine whether one can add at most k elements to X to obtain a set in the (implicitly defined) family.  ...  In the first case the local search problem can be solved in time d r · n O(1) . In the second case we do not know any better alternative to a brute-force search.  ... 
arXiv:1512.01621v1 fatcat:rpu436db45bqjfz5auirqcyt5u

Don't Be Strict in Local Search!

Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2021 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
(IJCAI 2009) studied whether this brute-force search is avoidable and gave positive and negative answers for several combinatorial problems. They used the notion of local search in a strict sense.  ...  However, for inputs of size n, a naive brute-force search of the k-exchange neighborhood requires n(O(k)) time, which is not practical even for very small values of k. Fellows et al.  ...  This question is important because the typical running time of a brute-force algorithm is n O(k) , where n is the input length.  ... 
doi:10.1609/aaai.v26i1.8128 fatcat:n3votkiuczavhpr6s5j3u7lrjq

Local search for quantified Boolean formulas

N. Hristov, A. Remshagen
2005 Proceedings of the 43rd annual southeast regional conference on - ACM-SE 43  
Though local search cannot be applied directly to QBF, we introduce an approach to solve QBF at the second level of the polynomial hierarchy that profits significantly from local search.  ...  We explore the possibility and potential of local search algorithms, which have been proved to be very successful in the case of SAT.  ...  Consider a brute-force solution algorithm that evaluates Formula (1).  ... 
doi:10.1145/1167350.1167390 dblp:conf/ACMse/HristovR05 fatcat:7wodokhklbdqzldc33nj7pjfuy

Don't Be Strict in Local Search!

Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2012 arXiv   pre-print
(IJCAI 2009) studied whether this brute-force search is avoidable and gave positive and negative answers for several combinatorial problems. They used the notion of local search in a strict sense.  ...  However, for inputs of size n, a na\"ive brute-force search of the k-exchange neighborhood requires n to the power of O(k) time, which is not practical even for very small values of k. Fellows et al.  ...  hard, strict local search is hard, but permissive local search is FPT.  ... 
arXiv:1208.1688v3 fatcat:z7fmvkaw6nhobot7tubbjvvi6u

A new approach to avoiding the local extrema trap

Alan McCabe, Jarrod Trevathan
2007 ANZIAM Journal  
The Extremum Consistency algorithm avoids local maxima and minima in a specialised domain.  ...  We describes the algorithm and present results from practical experimentation, which illustrates its superiority over other forms of local extrema avoidance in three real world applications.  ...  The calculation of the optimal threshold was done during a training phase via brute force experimentation for each application.  ... 
doi:10.21914/anziamj.v48i0.110 fatcat:45ucolarwzcgtj6dw7nhvzjk6q

Chemical Reaction Networks and Stochastic Local Search [chapter]

Erik Winfree
2019 Lecture Notes in Computer Science  
Here I show that some stochastic local search algorithms map naturally to stochastic chemical reaction networks.  ...  Stochastic local search can be an effective method for solving a wide variety of optimization and constraint satisfaction problems.  ...  stochastic local search will be forced to find a solution that also satisfies the environmental constraints.  ... 
doi:10.1007/978-3-030-26807-7_1 fatcat:fo4p66657vg3hbqztimmm4jzbu

Optimality of Geometric Local Search

Bruno Jartoux, Nabil H. Mustafa, Marc Herbstritt
2018 International Symposium on Computational Geometry  
The key ingredient, of independent interest, is a new lower bound on locally expanding planar graphs, which is then used to show the impossibility results.  ...  We show that in fact the approximation guarantee of local search cannot be improved for any of these problems.  ...  more efficiently than by brute force [6] .  ... 
doi:10.4230/lipics.socg.2018.48 dblp:conf/compgeom/JartouxM18 fatcat:xypsadjajnbzhgiigaw2w5ffxm

Financing Local Economic Development: In Search of the Optimal Local Financial System

Milford Bateman
2013 Social Science Research Network  
quickly plunged into a 'new world' of brute market forces, speculation, egregious risktaking, insider dealing, a 'greed is good' philosophy, tantalizing Initial Public Offerings (IPOs), and the self-declared  ...  Financing local economic development: in search of the optimal local financial system. In: ÖFSE (Hg.)  ... 
doi:10.2139/ssrn.2754901 fatcat:aqxclgrzwrbrvcjtagdor6ljjq

A local search mechanism for peer-to-peer networks

Vana Kalogeraki, Dimitrios Gunopulos, D. Zeinalipour-Yazti
2002 Proceedings of the eleventh international conference on Information and knowledge management - CIKM '02  
Typically the user specifies the name of the file he/she is looking for and searches for the file using a brute force mechanism, as we described in the previous section.  ...  The first, the modified Breadth-First-Search (BFS) mechanism, is an extension of the current Gnuttela protocol, allows searching with keywords, and is designed to minimize the number of messages that are  ...  than the brute force Gnutella protocol.  ... 
doi:10.1145/584838.584842 fatcat:3xrhf5hfgzd6faj7yq3fbfkpj4

A local search mechanism for peer-to-peer networks

Vana Kalogeraki, Dimitrios Gunopulos, D. Zeinalipour-Yazti
2002 Proceedings of the eleventh international conference on Information and knowledge management - CIKM '02  
Typically the user specifies the name of the file he/she is looking for and searches for the file using a brute force mechanism, as we described in the previous section.  ...  The first, the modified Breadth-First-Search (BFS) mechanism, is an extension of the current Gnuttela protocol, allows searching with keywords, and is designed to minimize the number of messages that are  ...  than the brute force Gnutella protocol.  ... 
doi:10.1145/584792.584842 dblp:conf/cikm/KalogerakiGZ02 fatcat:bb5h6bovqnc2xfpwjegid2h3xu

Iterative Grid Search For Rss-Based Emitter Localization

Emil Petriu, Suzan Üreten, Abbas Yongacoglu
2014 Zenodo  
Iterative grid search A full search algorithm is brute-force therefore it does not use any scheme to reduce the number of computations.  ...  One approach is to employ grid search where the algorithm scans all possible grid points in the localization space.  ... 
doi:10.5281/zenodo.43974 fatcat:iiy75nv7izcejbyqbzx2bzrnay

Similarity Search and Locality Sensitive Hashing using TCAMs [article]

Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojyoti Dutta
2010 arXiv   pre-print
While there exist efficient techniques for exact query lookup using hashing, similarity search using exact nearest neighbors is known to be a hard problem and in high dimensions, best known solutions offer  ...  polynomial in n, where n is the size of the database.  ...  Existing solutions to the exact nearest neighbor problem offer little improvement over brute force linear search.  ... 
arXiv:1006.3514v1 fatcat:iejs34mwivhtlpc2p3rcd47lqe
« Previous Showing results 1 — 15 out of 30,396 results