Sciweavers

970 search results - page 153 / 194
» On encodings of spanning trees
Sort
View
JPDC
2006
187views more  JPDC 2006»
13 years 11 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
ADHOC
2005
102views more  ADHOC 2005»
13 years 11 months ago
Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
Julien Cartigny, François Ingelrest, David ...
BIB
2007
158views more  BIB 2007»
13 years 10 months ago
Biodiversity informatics: organizing and linking information across the spectrum of life
Biological knowledge can be inferred from three major levels of information: molecules, organisms and ecologies. Bioinformatics is an established field that has made significant a...
Indra Neil Sarkar
COR
2008
160views more  COR 2008»
13 years 9 months ago
Formulations and exact algorithms for the vehicle routing problem with time windows
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
Brian Kallehauge
JCSS
2010
114views more  JCSS 2010»
13 years 9 months ago
FPT algorithms and kernels for the Directed k-Leaf problem
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
Jean Daligault, Gregory Gutin, Eun Jung Kim, Ander...