Sciweavers

2976 search results - page 594 / 596
» On the bounded integer programming
Sort
View
TWC
2008
113views more  TWC 2008»
13 years 5 months ago
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
Kai Zeng, Wenjing Lou, Hongqiang Zhai
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 4 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
INFOCOM
2010
IEEE
13 years 3 months ago
Opportunistic Routing in Multi-radio Multi-channel Multi-hop Wireless Networks
— Two major factors that limit the throughput in multi-hop wireless networks are the unreliability of wireless transmissions and co-channel interference. One promising technique ...
Kai Zeng, Zhenyu Yang, Wenjing Lou
JACM
2010
137views more  JACM 2010»
13 years 3 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
WIOPT
2010
IEEE
13 years 3 months ago
On maximizing collaboration in Wireless Mesh Networks without monetary incentives
—In distributed network settings, where nodes are not under the control of a single administrative entity, the fulfillment of fundamental network operations is heavily dependent...
Gabriel Popa, Éric Gourdin, Franck Legendre...