Sciweavers

344 search results - page 12 / 69
» The Directed Minimum Latency Problem
Sort
View
COMCOM
2010
118views more  COMCOM 2010»
14 years 6 months ago
Mini-slot scheduling for IEEE 802.16d chain and grid mesh networks
This work considers the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). An efficient mini-slot scheduling needs to take into account the transmission o...
Jia-Ming Liang, Ho-Cheng Wu, Jen-Jee Chen, Yu-Chee...
STACS
2004
Springer
15 years 2 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
CEC
2009
IEEE
15 years 22 days ago
Direct and explicit building blocks identification and composition algorithm
— This paper proposes a new algorithm to identify and compose building blocks based on minimum mutual information criterion. Building blocks are interpreted as common subsequence...
Chalermsub Sangkavichitr, Prabhas Chongstitvatana
NOMS
2008
IEEE
15 years 3 months ago
Optimizing request denial and latency in an agent-based VPN architecture
—Agent-based virtual private networks architecture (ABVA) refers to the environment where a third-party provider runs and administers remote access VPN service for organizations ...
Haiyang Qian, Steve Dispensa, Deep Medhi
DAM
2008
108views more  DAM 2008»
14 years 9 months ago
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
Cédric Bentz