Results 1  10
of
1,277,266
Greedy Local Search
"... at surprisingly, starting with "good" initial paths did not necessarily lead to better final solutions. The reason for this appears to be that the local search mechanism itself is powerful enough to improve upon the initial solutions  often quickly giving better solutions than those gen ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
at surprisingly, starting with "good" initial paths did not necessarily lead to better final solutions. The reason for this appears to be that the local search mechanism itself is powerful enough to improve upon the initial solutions  often quickly giving better solutions than those
An Empirical Study of Greedy Local Search for Satisfiability Testing
, 1993
"... GSAT is a randomized local search procedure for solving propositional satisfiability problems. GSAT can solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches, such as the DavisPutnam procedure. This paper presents ..."
Abstract

Cited by 104 (5 self)
 Add to MetaCart
GSAT is a randomized local search procedure for solving propositional satisfiability problems. GSAT can solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches, such as the DavisPutnam procedure. This paper
Gunsat: A greedy local search algorithm for unsatisfiability
 In 20th International Joint Conference on Artificial Intelligence
, 2007
"... Local search algorithms for satisfiability testing are still the best methods for a large number of problems, despite tremendous progresses observed on complete search algorithms over the last few years. However, their intrinsic limit does not allow them to address UNSAT problems. Ten years ago, thi ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Local search algorithms for satisfiability testing are still the best methods for a large number of problems, despite tremendous progresses observed on complete search algorithms over the last few years. However, their intrinsic limit does not allow them to address UNSAT problems. Ten years ago
An Empirical Study of Greedy Local Search for Satisfiability Testing
, 1993
"... GSAT is a randomized local search procedure for solving propositional satisfiability problems. GSAT can solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches, such as the DavisPutnam procedure. This paper pres ..."
Abstract
 Add to MetaCart
GSAT is a randomized local search procedure for solving propositional satisfiability problems. GSAT can solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches, such as the DavisPutnam procedure. This paper
Iterated greedy local search methods for unrelated parallel machine scheduling
, 2009
"... This work deals with the parallel machines scheduling problem which consists in the assignment of n jobs on m parallel machines. The most general variant of this problem is when the processing time depends on the machine to which each job is assigned to. This case is known as the unrelated parallel ..."
Abstract
 Add to MetaCart
procedures. By contrast, in this paper we propose a set of simple iterated greedy local search based metaheuristics that produce solutions of very good quality in a very short amount of time. Extensive computational campaigns show that these solutions are, most of the time, better than the current state
GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES
, 2002
"... GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract

Cited by 637 (79 self)
 Add to MetaCart
GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search
A Study of Greedy, Local Search and Ant Colony Optimization Approaches for Car Sequencing Problems
 In Applications of evolutionary computing, volume 2611 of LNCS
, 2003
"... This paper describes and compares several heuristic approaches for the car sequencing problem. We rst study greedy heuristics, and show that dynamic ones clearly outperform their static counterparts. ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
This paper describes and compares several heuristic approaches for the car sequencing problem. We rst study greedy heuristics, and show that dynamic ones clearly outperform their static counterparts.
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
GPSR: Greedy perimeter stateless routing for wireless networks
 MOBICOM
, 2000
"... We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of touters and a packer's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's i ..."
Abstract

Cited by 2238 (8 self)
 Add to MetaCart
's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in perrouter state than shortestpath and ad
A greedy algorithm for aligning DNA sequences
 J. COMPUT. BIOL
, 2000
"... For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy a ..."
Abstract

Cited by 576 (16 self)
 Add to MetaCart
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic programming approaches and yet produce an alignment that is guaranteed to be theoretically optimal. We introduce a new greedy
Results 1  10
of
1,277,266