Sciweavers

1632 search results - page 93 / 327
» On special numberings of hypergraphs
Sort
View
CORR
2010
Springer
97views Education» more  CORR 2010»
15 years 5 months ago
Towards a Collision-Free WLAN: Dynamic Parameter Adjustment in CSMA/E2CA
Abstract—Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is a distributed MAC protocol that allows collision-free access to the medium in WLAN. The onl...
Jaume Barceló, Boris Bellalta, Cristina Can...
AOR
2010
15 years 3 months ago
Solutions diversification in a column generation algorithm
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
Nora Touati Moungla, Lucas Létocart, Anass ...
COCOON
2011
Springer
14 years 6 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 11 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
SPAA
2009
ACM
16 years 7 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...