Sciweavers

658 search results - page 68 / 132
» Lower bounds for sorting networks
Sort
View
NETWORKS
2008
13 years 7 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
WIOPT
2006
IEEE
14 years 1 months ago
On the macroscopic effects of local interactions in multi-hop wireless networks
Abstract— The objective of the paper is to provide qualitative insight into the global effects of distributed mechanisms, such as carrier sense multiple access (CSMA) and rate co...
Venkatesh Saligrama, David Starobinski
SIROCCO
2007
13 years 9 months ago
Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions
Abstract. The problem we consider originates from the design of efficient on-board networks in satellites (also called Traveling Wave Tube Amplifiers). Signals incoming in the net...
Jean-Claude Bermond, Frédéric Giroir...
ASUNAM
2011
IEEE
12 years 7 months ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
ECAI
2008
Springer
13 years 9 months ago
Structure segmentation and recognition in images guided by structural constraint propagation
In some application domains, such as medical imaging, the objects that compose the scene are known as well as some of their properties and their spatial arrangement. We can take ad...
Olivier Nempont, Jamal Atif, Elsa D. Angelini, Isa...