Sciweavers

2192 search results - page 111 / 439
» Algorithms for Challenging Motif Problems
Sort
View
GLOBECOM
2009
IEEE
14 years 3 months ago
Downlink Mobile OFDMA Resource Allocation with Minimum User Rate Requests
— The problem of resource allocation (RA) in a downlink OFDMA system with minimum user rate requests is examined under the realistic scenario of partial (imperfect) channel state...
Stelios Stefanatos, Christos Papathanasiou, Nikos ...
IFM
2009
Springer
158views Formal Methods» more  IFM 2009»
14 years 2 months ago
Developing Topology Discovery in Event-B
Abstract. We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and ...
Thai Son Hoang, Hironobu Kuruma, David A. Basin, J...
BROADNETS
2006
IEEE
14 years 2 months ago
Minimum Rejection Scheduling in All-Photonic Networks
Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to per...
Nahid Saberi, Mark Coates
ADHOC
2007
108views more  ADHOC 2007»
13 years 8 months ago
Hop-distance based addressing and routing for dense sensor networks without location information
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
Serdar Vural, Eylem Ekici
INFOCOM
2009
IEEE
14 years 2 months ago
Virtual Network Embedding with Coordinated Node and Link Mapping
—Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by allowing multiple heterogeneous virtual networks (V...
N. M. Mosharaf Kabir Chowdhury, Muntasir Raihan Ra...