Results 1  10
of
798
The greedy pathmerging algorithm for sequence assembly
 Proc. RECOMB 2001
, 2001
"... Two different approaches to determining the human genome are currently being pursued: one is the “clonebyclone ” approach, employed by the publiclyfunded Human Genome Project, and the other is the “whole genome shotgun ” approach, favored by researchers at Celera Genomics. An interim strategy emp ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
employed at Celera, called compartmentalized assembly, makes use of preliminary data produced by both approaches. This paper introduces the Bactig Ordering Problem, which is a key problem that arises in this context, and presents an efficient heuristic called the greedy pathmerging algorithm that performs
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 647 (82 self)
 Add to MetaCart
based intensification and postoptimization techniques using pathrelinking. Hybridizations with other metaheuristics, parallelization strategies, and applications are also reviewed.
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 2290 (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
Greedy Path Planning for Maximizing Value of Information in Underwater Sensor Networks
"... Abstract—Underwater sensor networks (UWSNs) face specific challenges due to the transmission properties in the underwater environment. Radio waves propagate only for short distances under water, and acoustic transmissions have limited data rate and relatively high latency. One of the possible soluti ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
is to develop path planners for the movement of the AUV which maximizes the total VoI collected. We consider three different path planners: the lawn mower path planner (LPP), the greedy planner (GPP) and the random planner (RPP). In a simulation study we compare the total VoI collected by these algorithms
CONTINUOUS FIRSTPASSAGE PERCOLATION AND CONTINUOUS GREEDY PATHS MODEL: LINEAR GROWTH
, 707
"... Abstract. We study a random growth model on R d introduced by Deijfen. This is a continuous firstpassage percolation model. The growth occurs by means of spherical outbursts with random radii in the infected region. We aim at finding conditions on the distribution of the random radii to determine w ..."
Abstract
 Add to MetaCart
whether the growth of the process is linear or not. To do so, we compare this model with a continuous analogue of the greedy lattice paths model and transpose results in the lattice setting to the continuous setting.
Impact of network density on Data Aggregation in wireless sensor networks
, 2001
"... Innetwork data aggregation is essential for wireless sensor networks where resources (e.g., bandwidth, energy) are limited. In a previously proposed data dissemination scheme, data is opportunistically aggregated at the intermediate nodes on a lowlatency tree which may not necessarily be energy ef ..."
Abstract

Cited by 321 (4 self)
 Add to MetaCart
efficient. A more energyefficient tree is a greedy tree which can be incrementally constructed by connecting each source to the closest point of the existing tree. In this paper, we propose a greedy approach for constructing a greedy aggregation tree to improve path sharing. We evaluated the performance
Greedy Packet Scheduling on Shortest Paths
 Journal of Algorithms
, 1991
"... We investigate the simple class of greedy scheduling algorithms, that is, algorithms that always forward a packet if they can. Assuming that only one packet can be delivered over a link in a single step, and that the routes traversed by a set of packets are distance optimal ("shortest paths& ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
We investigate the simple class of greedy scheduling algorithms, that is, algorithms that always forward a packet if they can. Assuming that only one packet can be delivered over a link in a single step, and that the routes traversed by a set of packets are distance optimal ("shortest paths
Greedy optimal homotopy and homology generators
 Proc. 16th Ann. ACMSIAM Symp. Discrete Algorithms
, 2005
"... Abstract We describe simple greedy algorithms to construct the shortest set of loops that generates either the fundamental group (with a given basepoint) or the first homology group (over any fixed coefficient field) of any oriented 2manifold. In particular, we show that the shortest set of loops t ..."
Abstract

Cited by 102 (11 self)
 Add to MetaCart
Abstract We describe simple greedy algorithms to construct the shortest set of loops that generates either the fundamental group (with a given basepoint) or the first homology group (over any fixed coefficient field) of any oriented 2manifold. In particular, we show that the shortest set of loops
Greedy Randomized Adaptive Path Relinking
, 2001
"... this paper we present a new search procedure that combines GRASP concepts and those of Path Relinking. Summarizing, original Path Relinking finds a path between two "good" solutions in order to discover new ones, potentially better than the older solutions. GRASP's basic mechanisms ar ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
are the greedy randomized construction phase, where a feasible solution is built, and the local search procedure, where the neighborhood of the solution obtained is explored. Greedy randomized adaptive path relinking (GRAPR) constructs a GRASP to build di#erent paths in a Path Relinking phase
Universal Stability Results for Greedy ContentionResolution Protocols
 JOURNAL OF THE ACM
, 1996
"... In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We focus on a basic adversarial model of packet generation and path determination for which the timeaveraged injection rate o ..."
Abstract

Cited by 108 (16 self)
 Add to MetaCart
In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We focus on a basic adversarial model of packet generation and path determination for which the timeaveraged injection rate
Results 1  10
of
798