Sciweavers

4565 search results - page 476 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
DISOPT
2008
78views more  DISOPT 2008»
15 years 4 months ago
N-fold integer programming
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
Jesús A. De Loera, Raymond Hemmecke, Shmuel...
IPPS
1997
IEEE
15 years 8 months ago
Broadcasting and Multicasting in Cut-through Routed Networks
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
Johanne Cohen, Pierre Fraigniaud, Jean-Claude K&ou...
GLOBECOM
2008
IEEE
15 years 4 months ago
An Efficient Group Key Management for Secure Routing in Ad Hoc Networks
This paper proposes and specifies a protocol for distributing and managing group keys in ad hoc environments, which applies for the Secure Optimized Link State Routing Protocol. Ou...
Natalia Castro Fernandes, Otto Carlos Muniz Bandei...
EURODAC
1995
IEEE
130views VHDL» more  EURODAC 1995»
15 years 8 months ago
Semi-dynamic scheduling of synchronization-mechanisms
This paper presents a novel approach to scheduling of hardware supported synchronization operations. The optimization goal is to minimize the interation time of processes and thus...
Wolfgang Ecker
JEA
2006
83views more  JEA 2006»
15 years 4 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna