Results 1  10
of
32,117
Fast local search for the maximum independent set problem
 IN PROCEEDINGS OF WORKSHOP ON EXPERIMENTAL ALGORITHMS, LNCS 5038
, 2008
"... Given a graph G = (V, E), the independent set problem is that of finding a maximumcardinality subset S of V such that no two vertices in S are adjacent. We present a fast local search routine for this problem. Our algorithm can determine in linear time if a maximal solution can be improved by rep ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Given a graph G = (V, E), the independent set problem is that of finding a maximumcardinality subset S of V such that no two vertices in S are adjacent. We present a fast local search routine for this problem. Our algorithm can determine in linear time if a maximal solution can be improved
Fast Local Search for Steiner Trees in Graphs
, 2010
"... We present efficient algorithms that implement four local searches for the Steiner problem in graphs: vertex insertion, vertex elimination, keypath exchange, and keyvertex elimination. In each case, we show how to find an improving solution (or prove that none exists in the neighborhood) in O(m lo ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We present efficient algorithms that implement four local searches for the Steiner problem in graphs: vertex insertion, vertex elimination, keypath exchange, and keyvertex elimination. In each case, we show how to find an improving solution (or prove that none exists in the neighborhood) in O
Fast Local Searches and Updates in Bounded Universes
"... Given a bounded universe {0, 1,..., U −1}, we show how to perform (successor) searches in O(log log ∆) expected time and updates in O(log log ∆) expected amortized time, where ∆ is the rank difference between the element being searched for and its successor in the structure. This unifies the results ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Given a bounded universe {0, 1,..., U −1}, we show how to perform (successor) searches in O(log log ∆) expected time and updates in O(log log ∆) expected amortized time, where ∆ is the rank difference between the element being searched for and its successor in the structure. This unifies
Fast Local Search for the Steiner Problem in Graphs
, 2012
"... We present efficient algorithms that implement four local searches for the Steiner problem in graphs: vertex insertion, vertex elimination, keypath exchange, and keyvertex elimination. In each case, we show how to find an improving solution (or prove that none exists in the neighborhood) in O(m lo ..."
Abstract
 Add to MetaCart
We present efficient algorithms that implement four local searches for the Steiner problem in graphs: vertex insertion, vertex elimination, keypath exchange, and keyvertex elimination. In each case, we show how to find an improving solution (or prove that none exists in the neighborhood) in O
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
, 2010
"... We present a fast local search algorithm that finds an improved solution (if there is any) in the kexchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK ARC SET IN TOURNAMENTS. More precisely, given an arc weighted tournament T on n vertices and a feedback arc set F (a set ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We present a fast local search algorithm that finds an improved solution (if there is any) in the kexchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK ARC SET IN TOURNAMENTS. More precisely, given an arc weighted tournament T on n vertices and a feedback arc set F (a
Packet loss protection of embedded data with fast local search
 In Proc. Int’l Conf. Image Processing. IEEE
, 2002
"... Unequal loss protection with systematic ReedSolomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with low memory requirements for the computation of an unequal loss protection solution is essential in realtime systems. Becau ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
Unequal loss protection with systematic ReedSolomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with low memory requirements for the computation of an unequal loss protection solution is essential in realtime systems
Distortion Minimization with Fast Local Search for Fractal Image Compression
, 2000
"... this paper, we provide techniques that drastically ..."
WSAT(CC)  a fast localsearch ASP solver
"... We describe WSAT (CC ), a localsearch solver for computing models of theories in the language of propositional logic extended by cardinality atoms. WSAT (CC ) is a processing backend for the logic PS , a recently proposed formalism for answerset programming. ..."
Abstract
 Add to MetaCart
We describe WSAT (CC ), a localsearch solver for computing models of theories in the language of propositional logic extended by cardinality atoms. WSAT (CC ) is a processing backend for the logic PS , a recently proposed formalism for answerset programming.
Fast Local Search and Guided Local Search and Their Application to British Telecom’s Workforce Scheduling Problem
, 1997
"... ..."
A FAST LOCAL SEARCH ALGORITHM USING HISTOGRAM FEATURES FOR DNA SEQUENCE DATABASE International Journal of Bioinformatics Research
"... AbstractDNA sequence search is a very important topic in bioinformatics algorithm development. However, this task usually spends much computational time to search on large DNA sequence database. In this paper, we propose an efficient hierarchical DNA sequence search algorithm to improve the search ..."
Abstract
 Add to MetaCart
the search speed while the accuracy is being kept constant. For a given query DNA sequence, firstly, a fast local search algorithm using histogram features is used as a filtering mechanism before scanning the sequences in the database. An overlapping processing is newly added to improve the robustness
Results 1  10
of
32,117