Sciweavers

117 search results - page 19 / 24
» On the directed Full Degree Spanning Tree problem
Sort
View
ADHOC
2005
102views more  ADHOC 2005»
14 years 9 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 ...
85
Voted
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
15 years 2 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
MFCS
2007
Springer
15 years 3 months ago
NP by Means of Lifts and Shadows
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
Gábor Kun, Jaroslav Nesetril
STACS
2001
Springer
15 years 1 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
MOC
2000
69views more  MOC 2000»
14 years 9 months ago
Evaluating higher derivative tensors by forward propagation of univariate Taylor series
This article considers the problem of evaluating all pure and mixed partial derivatives of some vector function defined by an evaluation procedure. The natural approach to evaluati...
Andreas Griewank, Jean Utke, Andrea Walther